./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-63.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c00e63dc Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-63.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash f973c2bd61febfd05a080e69391fa31f4feb1b698b8895a930b455f19afe4cba --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 03:18:36,942 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 03:18:37,004 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-06 03:18:37,007 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 03:18:37,010 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 03:18:37,028 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 03:18:37,029 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 03:18:37,029 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 03:18:37,030 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 03:18:37,030 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 03:18:37,030 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 03:18:37,031 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 03:18:37,031 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 03:18:37,031 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 03:18:37,031 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 03:18:37,031 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 03:18:37,031 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-06 03:18:37,032 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 03:18:37,032 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 03:18:37,032 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 03:18:37,032 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 03:18:37,032 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-06 03:18:37,032 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 03:18:37,032 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-06 03:18:37,032 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 03:18:37,032 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-06 03:18:37,032 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 03:18:37,032 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 03:18:37,032 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 03:18:37,032 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 03:18:37,033 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 03:18:37,033 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 03:18:37,033 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 03:18:37,033 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 03:18:37,033 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 03:18:37,033 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-06 03:18:37,034 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-06 03:18:37,034 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-06 03:18:37,034 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-06 03:18:37,034 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 03:18:37,034 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 03:18:37,034 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 03:18:37,034 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 03:18:37,034 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> f973c2bd61febfd05a080e69391fa31f4feb1b698b8895a930b455f19afe4cba [2025-02-06 03:18:37,264 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 03:18:37,271 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 03:18:37,273 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 03:18:37,274 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 03:18:37,274 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 03:18:37,275 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-63.i [2025-02-06 03:18:38,528 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/e40192072/4b123f5f22324d02be8aaa6a0d4bff76/FLAG69dfae32f [2025-02-06 03:18:38,800 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 03:18:38,801 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-63.i [2025-02-06 03:18:38,809 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/e40192072/4b123f5f22324d02be8aaa6a0d4bff76/FLAG69dfae32f [2025-02-06 03:18:39,090 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/e40192072/4b123f5f22324d02be8aaa6a0d4bff76 [2025-02-06 03:18:39,092 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 03:18:39,093 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 03:18:39,094 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 03:18:39,094 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 03:18:39,097 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 03:18:39,097 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 03:18:39" (1/1) ... [2025-02-06 03:18:39,098 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@14ac8d00 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:18:39, skipping insertion in model container [2025-02-06 03:18:39,098 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 03:18:39" (1/1) ... [2025-02-06 03:18:39,109 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 03:18:39,209 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-63.i[916,929] [2025-02-06 03:18:39,263 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 03:18:39,271 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 03:18:39,282 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-63.i[916,929] [2025-02-06 03:18:39,324 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 03:18:39,335 INFO L204 MainTranslator]: Completed translation [2025-02-06 03:18:39,336 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:18:39 WrapperNode [2025-02-06 03:18:39,336 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 03:18:39,337 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 03:18:39,338 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 03:18:39,338 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 03:18:39,342 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:18:39" (1/1) ... [2025-02-06 03:18:39,358 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:18:39" (1/1) ... [2025-02-06 03:18:39,388 INFO L138 Inliner]: procedures = 29, calls = 209, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 666 [2025-02-06 03:18:39,389 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 03:18:39,389 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 03:18:39,389 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 03:18:39,389 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 03:18:39,395 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:18:39" (1/1) ... [2025-02-06 03:18:39,396 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:18:39" (1/1) ... [2025-02-06 03:18:39,399 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:18:39" (1/1) ... [2025-02-06 03:18:39,411 INFO L175 MemorySlicer]: Split 174 memory accesses to 7 slices as follows [2, 16, 44, 90, 5, 8, 9]. 52 percent of accesses are in the largest equivalence class. The 20 initializations are split as follows [2, 3, 4, 7, 1, 1, 2]. The 19 writes are split as follows [0, 3, 4, 7, 2, 1, 2]. [2025-02-06 03:18:39,412 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:18:39" (1/1) ... [2025-02-06 03:18:39,412 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:18:39" (1/1) ... [2025-02-06 03:18:39,431 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:18:39" (1/1) ... [2025-02-06 03:18:39,432 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:18:39" (1/1) ... [2025-02-06 03:18:39,436 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:18:39" (1/1) ... [2025-02-06 03:18:39,437 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:18:39" (1/1) ... [2025-02-06 03:18:39,440 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 03:18:39,441 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 03:18:39,441 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 03:18:39,441 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 03:18:39,441 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:18:39" (1/1) ... [2025-02-06 03:18:39,445 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 03:18:39,453 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 03:18:39,466 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-06 03:18:39,478 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-06 03:18:39,494 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 03:18:39,494 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#0 [2025-02-06 03:18:39,494 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#1 [2025-02-06 03:18:39,494 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#2 [2025-02-06 03:18:39,494 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#3 [2025-02-06 03:18:39,494 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#4 [2025-02-06 03:18:39,494 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#5 [2025-02-06 03:18:39,494 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#6 [2025-02-06 03:18:39,494 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-02-06 03:18:39,494 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-02-06 03:18:39,495 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-02-06 03:18:39,495 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-02-06 03:18:39,495 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-02-06 03:18:39,495 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2025-02-06 03:18:39,495 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2025-02-06 03:18:39,495 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2025-02-06 03:18:39,495 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2025-02-06 03:18:39,495 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#2 [2025-02-06 03:18:39,495 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#3 [2025-02-06 03:18:39,495 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#4 [2025-02-06 03:18:39,495 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#5 [2025-02-06 03:18:39,495 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#6 [2025-02-06 03:18:39,495 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-02-06 03:18:39,495 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-02-06 03:18:39,496 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-02-06 03:18:39,496 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-02-06 03:18:39,496 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-02-06 03:18:39,496 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2025-02-06 03:18:39,496 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2025-02-06 03:18:39,496 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#0 [2025-02-06 03:18:39,496 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#1 [2025-02-06 03:18:39,496 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#2 [2025-02-06 03:18:39,496 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#3 [2025-02-06 03:18:39,496 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#4 [2025-02-06 03:18:39,496 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#5 [2025-02-06 03:18:39,496 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#6 [2025-02-06 03:18:39,496 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-06 03:18:39,497 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-06 03:18:39,497 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-06 03:18:39,497 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-06 03:18:39,497 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-02-06 03:18:39,497 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-02-06 03:18:39,497 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-02-06 03:18:39,497 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-02-06 03:18:39,497 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2025-02-06 03:18:39,497 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 03:18:39,497 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 03:18:39,625 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 03:18:39,627 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 03:18:40,123 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L96: havoc property_#t~mem117#1;havoc property_#t~ite119#1;havoc property_#t~mem118#1;havoc property_#t~mem120#1;havoc property_#t~mem121#1;havoc property_#t~ite126#1;havoc property_#t~mem125#1;havoc property_#t~mem122#1;havoc property_#t~mem123#1;havoc property_#t~short124#1;havoc property_#t~mem133#1;havoc property_#t~mem127#1;havoc property_#t~mem128#1;havoc property_#t~ite131#1;havoc property_#t~mem129#1;havoc property_#t~mem130#1;havoc property_#t~mem132#1;havoc property_#t~ite160#1;havoc property_#t~mem157#1;havoc property_#t~mem134#1;havoc property_#t~mem135#1;havoc property_#t~mem136#1;havoc property_#t~ite140#1;havoc property_#t~mem137#1;havoc property_#t~mem138#1;havoc property_#t~mem139#1;havoc property_#t~mem141#1;havoc property_#t~ite144#1;havoc property_#t~mem142#1;havoc property_#t~mem143#1;havoc property_#t~ite156#1;havoc property_#t~mem145#1;havoc property_#t~mem146#1;havoc property_#t~mem147#1;havoc property_#t~ite151#1;havoc property_#t~mem148#1;havoc property_#t~mem149#1;havoc property_#t~mem150#1;havoc property_#t~mem152#1;havoc property_#t~ite155#1;havoc property_#t~mem153#1;havoc property_#t~mem154#1;havoc property_#t~mem159#1;havoc property_#t~mem158#1;havoc property_#t~short161#1;havoc property_#t~mem163#1;havoc property_#t~mem162#1;havoc property_#t~short164#1;havoc property_#t~mem170#1;havoc property_#t~mem165#1;havoc property_#t~mem166#1;havoc property_#t~ite169#1;havoc property_#t~mem167#1;havoc property_#t~mem168#1;havoc property_#t~ite183#1;havoc property_#t~mem182#1;havoc property_#t~mem171#1;havoc property_#t~mem172#1;havoc property_#t~ite175#1;havoc property_#t~mem173#1;havoc property_#t~mem174#1;havoc property_#t~mem176#1;havoc property_#t~mem177#1;havoc property_#t~mem178#1;havoc property_#t~ite181#1;havoc property_#t~mem179#1;havoc property_#t~mem180#1;havoc property_#t~short184#1;havoc property_#t~mem185#1;havoc property_#t~short186#1;havoc property_#t~mem188#1;havoc property_#t~mem187#1;havoc property_#t~short189#1;havoc property_#t~mem191#1;havoc property_#t~mem190#1;havoc property_#t~short192#1; [2025-02-06 03:18:40,171 INFO L? ?]: Removed 201 outVars from TransFormulas that were not future-live. [2025-02-06 03:18:40,171 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 03:18:40,182 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 03:18:40,183 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 03:18:40,184 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 03:18:40 BoogieIcfgContainer [2025-02-06 03:18:40,184 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 03:18:40,188 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 03:18:40,188 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 03:18:40,191 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 03:18:40,191 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 03:18:39" (1/3) ... [2025-02-06 03:18:40,192 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4694f271 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 03:18:40, skipping insertion in model container [2025-02-06 03:18:40,193 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:18:39" (2/3) ... [2025-02-06 03:18:40,193 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4694f271 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 03:18:40, skipping insertion in model container [2025-02-06 03:18:40,193 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 03:18:40" (3/3) ... [2025-02-06 03:18:40,194 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-a_file-63.i [2025-02-06 03:18:40,203 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 03:18:40,206 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-a_file-63.i that has 2 procedures, 138 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-06 03:18:40,262 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 03:18:40,296 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;@3a74347a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 03:18:40,297 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-06 03:18:40,300 INFO L276 IsEmpty]: Start isEmpty. Operand has 138 states, 117 states have (on average 1.4273504273504274) internal successors, (167), 118 states have internal predecessors, (167), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-02-06 03:18:40,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2025-02-06 03:18:40,308 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:18:40,309 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-06 03:18:40,309 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:18:40,313 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:18:40,313 INFO L85 PathProgramCache]: Analyzing trace with hash -961652529, now seen corresponding path program 1 times [2025-02-06 03:18:40,318 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:18:40,319 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1646785066] [2025-02-06 03:18:40,319 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:18:40,319 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:18:40,417 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 156 statements into 1 equivalence classes. [2025-02-06 03:18:40,437 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 156 of 156 statements. [2025-02-06 03:18:40,437 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:18:40,437 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:18:40,577 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 578 trivial. 0 not checked. [2025-02-06 03:18:40,577 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:18:40,577 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1646785066] [2025-02-06 03:18:40,578 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1646785066] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 03:18:40,578 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1159863082] [2025-02-06 03:18:40,578 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:18:40,578 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 03:18:40,578 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 03:18:40,580 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 03:18:40,582 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-06 03:18:40,754 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 156 statements into 1 equivalence classes. [2025-02-06 03:18:40,833 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 156 of 156 statements. [2025-02-06 03:18:40,834 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:18:40,834 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:18:40,842 INFO L256 TraceCheckSpWp]: Trace formula consists of 563 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-02-06 03:18:40,849 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:18:40,869 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 578 trivial. 0 not checked. [2025-02-06 03:18:40,872 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 03:18:40,872 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1159863082] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:18:40,872 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 03:18:40,872 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-02-06 03:18:40,874 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1469298958] [2025-02-06 03:18:40,874 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:18:40,876 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-06 03:18:40,877 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:18:40,891 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-06 03:18:40,891 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-06 03:18:40,894 INFO L87 Difference]: Start difference. First operand has 138 states, 117 states have (on average 1.4273504273504274) internal successors, (167), 118 states have internal predecessors, (167), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) Second operand has 2 states, 2 states have (on average 35.5) internal successors, (71), 2 states have internal predecessors, (71), 2 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2025-02-06 03:18:40,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:18:40,920 INFO L93 Difference]: Finished difference Result 270 states and 419 transitions. [2025-02-06 03:18:40,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-06 03:18:40,921 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 35.5) internal successors, (71), 2 states have internal predecessors, (71), 2 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) Word has length 156 [2025-02-06 03:18:40,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:18:40,926 INFO L225 Difference]: With dead ends: 270 [2025-02-06 03:18:40,926 INFO L226 Difference]: Without dead ends: 135 [2025-02-06 03:18:40,929 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 157 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-02-06 03:18:40,930 INFO L435 NwaCegarLoop]: 198 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, 198 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-02-06 03:18:40,931 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 198 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 03:18:40,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2025-02-06 03:18:40,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 135. [2025-02-06 03:18:40,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 115 states have (on average 1.4086956521739131) internal successors, (162), 115 states have internal predecessors, (162), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-02-06 03:18:40,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 198 transitions. [2025-02-06 03:18:40,959 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 198 transitions. Word has length 156 [2025-02-06 03:18:40,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:18:40,959 INFO L471 AbstractCegarLoop]: Abstraction has 135 states and 198 transitions. [2025-02-06 03:18:40,959 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 35.5) internal successors, (71), 2 states have internal predecessors, (71), 2 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2025-02-06 03:18:40,959 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 198 transitions. [2025-02-06 03:18:40,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2025-02-06 03:18:40,962 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:18:40,962 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-06 03:18:40,972 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-02-06 03:18:41,166 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-02-06 03:18:41,167 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:18:41,167 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:18:41,167 INFO L85 PathProgramCache]: Analyzing trace with hash 441779805, now seen corresponding path program 1 times [2025-02-06 03:18:41,167 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:18:41,167 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [689428489] [2025-02-06 03:18:41,167 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:18:41,168 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:18:41,238 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 156 statements into 1 equivalence classes. [2025-02-06 03:18:41,280 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 156 of 156 statements. [2025-02-06 03:18:41,281 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:18:41,281 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:18:41,593 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 561 trivial. 0 not checked. [2025-02-06 03:18:41,594 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:18:41,594 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [689428489] [2025-02-06 03:18:41,594 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [689428489] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 03:18:41,594 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [113400135] [2025-02-06 03:18:41,594 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:18:41,594 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 03:18:41,594 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 03:18:41,601 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 03:18:41,602 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-06 03:18:41,781 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 156 statements into 1 equivalence classes. [2025-02-06 03:18:41,849 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 156 of 156 statements. [2025-02-06 03:18:41,849 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:18:41,850 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:18:41,853 INFO L256 TraceCheckSpWp]: Trace formula consists of 563 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-06 03:18:41,860 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:18:41,905 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-02-06 03:18:41,906 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 03:18:41,906 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [113400135] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:18:41,909 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 03:18:41,909 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 8 [2025-02-06 03:18:41,910 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [995962779] [2025-02-06 03:18:41,910 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:18:41,910 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 03:18:41,910 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:18:41,911 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 03:18:41,911 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-02-06 03:18:41,911 INFO L87 Difference]: Start difference. First operand 135 states and 198 transitions. Second operand has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-02-06 03:18:41,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:18:41,959 INFO L93 Difference]: Finished difference Result 270 states and 397 transitions. [2025-02-06 03:18:41,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 03:18:41,959 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 156 [2025-02-06 03:18:41,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:18:41,961 INFO L225 Difference]: With dead ends: 270 [2025-02-06 03:18:41,961 INFO L226 Difference]: Without dead ends: 138 [2025-02-06 03:18:41,962 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 156 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-02-06 03:18:41,962 INFO L435 NwaCegarLoop]: 195 mSDtfsCounter, 1 mSDsluCounter, 379 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 574 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 03:18:41,962 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 574 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 03:18:41,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2025-02-06 03:18:41,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 137. [2025-02-06 03:18:41,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 117 states have (on average 1.4017094017094016) internal successors, (164), 117 states have internal predecessors, (164), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-02-06 03:18:41,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 200 transitions. [2025-02-06 03:18:41,982 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 200 transitions. Word has length 156 [2025-02-06 03:18:41,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:18:41,983 INFO L471 AbstractCegarLoop]: Abstraction has 137 states and 200 transitions. [2025-02-06 03:18:41,984 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-02-06 03:18:41,984 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 200 transitions. [2025-02-06 03:18:41,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2025-02-06 03:18:41,989 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:18:41,989 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-06 03:18:42,004 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-02-06 03:18:42,189 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 03:18:42,190 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:18:42,190 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:18:42,190 INFO L85 PathProgramCache]: Analyzing trace with hash 148376798, now seen corresponding path program 1 times [2025-02-06 03:18:42,190 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:18:42,190 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [746493237] [2025-02-06 03:18:42,190 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:18:42,191 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:18:42,234 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 156 statements into 1 equivalence classes. [2025-02-06 03:18:42,269 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 156 of 156 statements. [2025-02-06 03:18:42,269 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:18:42,269 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:18:42,500 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 561 trivial. 0 not checked. [2025-02-06 03:18:42,500 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:18:42,500 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [746493237] [2025-02-06 03:18:42,501 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [746493237] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 03:18:42,501 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [243908961] [2025-02-06 03:18:42,501 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:18:42,501 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 03:18:42,501 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 03:18:42,504 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 03:18:42,506 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-02-06 03:18:42,645 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 156 statements into 1 equivalence classes. [2025-02-06 03:18:42,714 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 156 of 156 statements. [2025-02-06 03:18:42,714 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:18:42,714 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:18:42,716 INFO L256 TraceCheckSpWp]: Trace formula consists of 558 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-06 03:18:42,724 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:18:42,755 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-02-06 03:18:42,757 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 03:18:42,760 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [243908961] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:18:42,760 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 03:18:42,760 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 8 [2025-02-06 03:18:42,760 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1708292524] [2025-02-06 03:18:42,760 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:18:42,761 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 03:18:42,761 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:18:42,765 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 03:18:42,765 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-02-06 03:18:42,765 INFO L87 Difference]: Start difference. First operand 137 states and 200 transitions. Second operand has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-02-06 03:18:42,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:18:42,806 INFO L93 Difference]: Finished difference Result 274 states and 401 transitions. [2025-02-06 03:18:42,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 03:18:42,807 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 156 [2025-02-06 03:18:42,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:18:42,812 INFO L225 Difference]: With dead ends: 274 [2025-02-06 03:18:42,812 INFO L226 Difference]: Without dead ends: 140 [2025-02-06 03:18:42,813 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 156 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-02-06 03:18:42,813 INFO L435 NwaCegarLoop]: 195 mSDtfsCounter, 1 mSDsluCounter, 379 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 574 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 03:18:42,814 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 574 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 03:18:42,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2025-02-06 03:18:42,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 139. [2025-02-06 03:18:42,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139 states, 119 states have (on average 1.3949579831932772) internal successors, (166), 119 states have internal predecessors, (166), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-02-06 03:18:42,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 202 transitions. [2025-02-06 03:18:42,822 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 202 transitions. Word has length 156 [2025-02-06 03:18:42,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:18:42,823 INFO L471 AbstractCegarLoop]: Abstraction has 139 states and 202 transitions. [2025-02-06 03:18:42,823 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-02-06 03:18:42,823 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 202 transitions. [2025-02-06 03:18:42,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2025-02-06 03:18:42,825 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:18:42,825 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-06 03:18:42,832 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-02-06 03:18:43,029 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 03:18:43,029 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:18:43,030 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:18:43,030 INFO L85 PathProgramCache]: Analyzing trace with hash -1659077665, now seen corresponding path program 1 times [2025-02-06 03:18:43,030 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:18:43,030 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1152196371] [2025-02-06 03:18:43,030 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:18:43,030 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:18:43,061 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 156 statements into 1 equivalence classes. [2025-02-06 03:18:43,082 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 156 of 156 statements. [2025-02-06 03:18:43,083 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:18:43,083 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:18:43,254 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 561 trivial. 0 not checked. [2025-02-06 03:18:43,254 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:18:43,254 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1152196371] [2025-02-06 03:18:43,254 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1152196371] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 03:18:43,254 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1444476882] [2025-02-06 03:18:43,256 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:18:43,256 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 03:18:43,256 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 03:18:43,258 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 03:18:43,260 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-02-06 03:18:43,416 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 156 statements into 1 equivalence classes. [2025-02-06 03:18:43,483 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 156 of 156 statements. [2025-02-06 03:18:43,484 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:18:43,484 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:18:43,487 INFO L256 TraceCheckSpWp]: Trace formula consists of 555 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-06 03:18:43,490 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:18:43,520 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-02-06 03:18:43,520 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 03:18:43,520 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1444476882] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:18:43,520 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 03:18:43,520 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 8 [2025-02-06 03:18:43,520 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1375804614] [2025-02-06 03:18:43,521 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:18:43,521 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 03:18:43,521 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:18:43,522 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 03:18:43,522 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-02-06 03:18:43,522 INFO L87 Difference]: Start difference. First operand 139 states and 202 transitions. Second operand has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-02-06 03:18:43,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:18:43,543 INFO L93 Difference]: Finished difference Result 278 states and 405 transitions. [2025-02-06 03:18:43,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 03:18:43,543 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 156 [2025-02-06 03:18:43,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:18:43,545 INFO L225 Difference]: With dead ends: 278 [2025-02-06 03:18:43,545 INFO L226 Difference]: Without dead ends: 142 [2025-02-06 03:18:43,545 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 156 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-02-06 03:18:43,546 INFO L435 NwaCegarLoop]: 195 mSDtfsCounter, 1 mSDsluCounter, 380 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 575 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 03:18:43,546 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 575 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 03:18:43,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2025-02-06 03:18:43,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 141. [2025-02-06 03:18:43,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 141 states, 121 states have (on average 1.3884297520661157) internal successors, (168), 121 states have internal predecessors, (168), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-02-06 03:18:43,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 204 transitions. [2025-02-06 03:18:43,553 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 204 transitions. Word has length 156 [2025-02-06 03:18:43,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:18:43,553 INFO L471 AbstractCegarLoop]: Abstraction has 141 states and 204 transitions. [2025-02-06 03:18:43,553 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-02-06 03:18:43,554 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 204 transitions. [2025-02-06 03:18:43,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2025-02-06 03:18:43,555 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:18:43,555 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-06 03:18:43,564 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-02-06 03:18:43,759 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 03:18:43,759 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:18:43,760 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:18:43,760 INFO L85 PathProgramCache]: Analyzing trace with hash -771573984, now seen corresponding path program 1 times [2025-02-06 03:18:43,760 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:18:43,760 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [24785547] [2025-02-06 03:18:43,760 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:18:43,760 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:18:43,792 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 156 statements into 1 equivalence classes. [2025-02-06 03:18:43,803 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 156 of 156 statements. [2025-02-06 03:18:43,803 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:18:43,803 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:18:43,910 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 561 trivial. 0 not checked. [2025-02-06 03:18:43,911 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:18:43,911 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [24785547] [2025-02-06 03:18:43,911 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [24785547] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 03:18:43,911 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1541737798] [2025-02-06 03:18:43,911 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:18:43,911 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 03:18:43,911 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 03:18:43,914 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 03:18:43,915 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-02-06 03:18:44,053 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 156 statements into 1 equivalence classes. [2025-02-06 03:18:44,105 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 156 of 156 statements. [2025-02-06 03:18:44,105 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:18:44,105 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:18:44,108 INFO L256 TraceCheckSpWp]: Trace formula consists of 550 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-06 03:18:44,110 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:18:44,127 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-02-06 03:18:44,127 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 03:18:44,127 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1541737798] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:18:44,127 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 03:18:44,127 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 8 [2025-02-06 03:18:44,127 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1506993832] [2025-02-06 03:18:44,128 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:18:44,128 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 03:18:44,128 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:18:44,128 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 03:18:44,129 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-02-06 03:18:44,129 INFO L87 Difference]: Start difference. First operand 141 states and 204 transitions. Second operand has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-02-06 03:18:44,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:18:44,147 INFO L93 Difference]: Finished difference Result 282 states and 409 transitions. [2025-02-06 03:18:44,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 03:18:44,148 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 156 [2025-02-06 03:18:44,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:18:44,149 INFO L225 Difference]: With dead ends: 282 [2025-02-06 03:18:44,149 INFO L226 Difference]: Without dead ends: 144 [2025-02-06 03:18:44,149 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 156 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-02-06 03:18:44,150 INFO L435 NwaCegarLoop]: 195 mSDtfsCounter, 1 mSDsluCounter, 382 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 577 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 03:18:44,150 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 577 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 03:18:44,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2025-02-06 03:18:44,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 143. [2025-02-06 03:18:44,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143 states, 123 states have (on average 1.3821138211382114) internal successors, (170), 123 states have internal predecessors, (170), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-02-06 03:18:44,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 206 transitions. [2025-02-06 03:18:44,156 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 206 transitions. Word has length 156 [2025-02-06 03:18:44,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:18:44,157 INFO L471 AbstractCegarLoop]: Abstraction has 143 states and 206 transitions. [2025-02-06 03:18:44,157 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-02-06 03:18:44,157 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 206 transitions. [2025-02-06 03:18:44,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2025-02-06 03:18:44,158 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:18:44,158 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-06 03:18:44,165 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-02-06 03:18:44,362 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 03:18:44,362 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:18:44,363 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:18:44,366 INFO L85 PathProgramCache]: Analyzing trace with hash -770650463, now seen corresponding path program 1 times [2025-02-06 03:18:44,366 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:18:44,366 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [970369498] [2025-02-06 03:18:44,366 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:18:44,367 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:18:44,401 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 156 statements into 1 equivalence classes. [2025-02-06 03:18:44,418 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 156 of 156 statements. [2025-02-06 03:18:44,419 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:18:44,419 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:18:44,588 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 561 trivial. 0 not checked. [2025-02-06 03:18:44,589 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:18:44,589 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [970369498] [2025-02-06 03:18:44,589 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [970369498] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 03:18:44,589 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [145852537] [2025-02-06 03:18:44,589 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:18:44,589 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 03:18:44,589 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 03:18:44,591 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 03:18:44,593 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-02-06 03:18:44,751 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 156 statements into 1 equivalence classes. [2025-02-06 03:18:44,801 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 156 of 156 statements. [2025-02-06 03:18:44,802 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:18:44,802 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:18:44,804 INFO L256 TraceCheckSpWp]: Trace formula consists of 545 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-06 03:18:44,807 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:18:44,835 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-02-06 03:18:44,835 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 03:18:44,835 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [145852537] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:18:44,835 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 03:18:44,835 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 7 [2025-02-06 03:18:44,835 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [981166132] [2025-02-06 03:18:44,835 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:18:44,836 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 03:18:44,836 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:18:44,836 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 03:18:44,836 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-02-06 03:18:44,836 INFO L87 Difference]: Start difference. First operand 143 states and 206 transitions. Second operand has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-02-06 03:18:44,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:18:44,854 INFO L93 Difference]: Finished difference Result 285 states and 412 transitions. [2025-02-06 03:18:44,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 03:18:44,855 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 156 [2025-02-06 03:18:44,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:18:44,856 INFO L225 Difference]: With dead ends: 285 [2025-02-06 03:18:44,856 INFO L226 Difference]: Without dead ends: 145 [2025-02-06 03:18:44,856 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 157 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-02-06 03:18:44,857 INFO L435 NwaCegarLoop]: 196 mSDtfsCounter, 0 mSDsluCounter, 381 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 577 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 03:18:44,857 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 577 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 03:18:44,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2025-02-06 03:18:44,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 145. [2025-02-06 03:18:44,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145 states, 125 states have (on average 1.376) internal successors, (172), 125 states have internal predecessors, (172), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-02-06 03:18:44,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 208 transitions. [2025-02-06 03:18:44,863 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 208 transitions. Word has length 156 [2025-02-06 03:18:44,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:18:44,863 INFO L471 AbstractCegarLoop]: Abstraction has 145 states and 208 transitions. [2025-02-06 03:18:44,863 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-02-06 03:18:44,863 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 208 transitions. [2025-02-06 03:18:44,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2025-02-06 03:18:44,864 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:18:44,864 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-06 03:18:44,874 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-02-06 03:18:45,069 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2025-02-06 03:18:45,069 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:18:45,070 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:18:45,070 INFO L85 PathProgramCache]: Analyzing trace with hash -1149718401, now seen corresponding path program 1 times [2025-02-06 03:18:45,070 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:18:45,070 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [520723036] [2025-02-06 03:18:45,070 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:18:45,070 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:18:45,107 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 158 statements into 1 equivalence classes. [2025-02-06 03:18:45,192 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 158 of 158 statements. [2025-02-06 03:18:45,192 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:18:45,192 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:18:45,579 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 3 proven. 48 refuted. 0 times theorem prover too weak. 561 trivial. 0 not checked. [2025-02-06 03:18:45,579 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:18:45,579 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [520723036] [2025-02-06 03:18:45,579 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [520723036] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 03:18:45,579 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1793206169] [2025-02-06 03:18:45,579 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:18:45,580 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 03:18:45,580 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 03:18:45,581 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 03:18:45,584 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-02-06 03:18:45,730 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 158 statements into 1 equivalence classes. [2025-02-06 03:18:45,784 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 158 of 158 statements. [2025-02-06 03:18:45,784 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:18:45,784 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:18:45,790 INFO L256 TraceCheckSpWp]: Trace formula consists of 554 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-02-06 03:18:45,794 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:18:46,056 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 29 treesize of output 22 [2025-02-06 03:18:46,160 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 83 proven. 48 refuted. 0 times theorem prover too weak. 481 trivial. 0 not checked. [2025-02-06 03:18:46,160 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 03:18:46,391 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 3 proven. 48 refuted. 0 times theorem prover too weak. 561 trivial. 0 not checked. [2025-02-06 03:18:46,392 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1793206169] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 03:18:46,392 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 03:18:46,392 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 13 [2025-02-06 03:18:46,392 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2126118346] [2025-02-06 03:18:46,392 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 03:18:46,392 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-02-06 03:18:46,392 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:18:46,393 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-02-06 03:18:46,393 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2025-02-06 03:18:46,393 INFO L87 Difference]: Start difference. First operand 145 states and 208 transitions. Second operand has 13 states, 11 states have (on average 8.818181818181818) internal successors, (97), 13 states have internal predecessors, (97), 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-02-06 03:18:46,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:18:46,683 INFO L93 Difference]: Finished difference Result 295 states and 420 transitions. [2025-02-06 03:18:46,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-02-06 03:18:46,683 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 11 states have (on average 8.818181818181818) internal successors, (97), 13 states have internal predecessors, (97), 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 158 [2025-02-06 03:18:46,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:18:46,684 INFO L225 Difference]: With dead ends: 295 [2025-02-06 03:18:46,684 INFO L226 Difference]: Without dead ends: 153 [2025-02-06 03:18:46,685 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 332 GetRequests, 310 SyntacticMatches, 2 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=122, Invalid=340, Unknown=0, NotChecked=0, Total=462 [2025-02-06 03:18:46,685 INFO L435 NwaCegarLoop]: 169 mSDtfsCounter, 564 mSDsluCounter, 812 mSDsCounter, 0 mSdLazyCounter, 308 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 565 SdHoareTripleChecker+Valid, 981 SdHoareTripleChecker+Invalid, 357 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 308 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 03:18:46,685 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [565 Valid, 981 Invalid, 357 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 308 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 03:18:46,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2025-02-06 03:18:46,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 149. [2025-02-06 03:18:46,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 149 states, 128 states have (on average 1.359375) internal successors, (174), 128 states have internal predecessors, (174), 18 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-02-06 03:18:46,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 210 transitions. [2025-02-06 03:18:46,696 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 210 transitions. Word has length 158 [2025-02-06 03:18:46,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:18:46,697 INFO L471 AbstractCegarLoop]: Abstraction has 149 states and 210 transitions. [2025-02-06 03:18:46,697 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 11 states have (on average 8.818181818181818) internal successors, (97), 13 states have internal predecessors, (97), 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-02-06 03:18:46,697 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 210 transitions. [2025-02-06 03:18:46,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2025-02-06 03:18:46,698 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:18:46,698 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-06 03:18:46,705 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-02-06 03:18:46,898 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 03:18:46,899 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:18:46,899 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:18:46,899 INFO L85 PathProgramCache]: Analyzing trace with hash -2146790754, now seen corresponding path program 1 times [2025-02-06 03:18:46,899 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:18:46,899 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [948263218] [2025-02-06 03:18:46,899 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:18:46,899 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:18:46,917 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 158 statements into 1 equivalence classes. [2025-02-06 03:18:46,934 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 158 of 158 statements. [2025-02-06 03:18:46,934 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:18:46,934 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:18:47,269 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-02-06 03:18:47,270 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:18:47,270 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [948263218] [2025-02-06 03:18:47,270 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [948263218] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:18:47,270 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:18:47,270 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-06 03:18:47,270 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1560752639] [2025-02-06 03:18:47,270 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:18:47,271 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-06 03:18:47,271 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:18:47,271 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-06 03:18:47,271 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-02-06 03:18:47,271 INFO L87 Difference]: Start difference. First operand 149 states and 210 transitions. Second operand has 7 states, 7 states have (on average 10.142857142857142) internal successors, (71), 7 states have internal predecessors, (71), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-02-06 03:18:47,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:18:47,348 INFO L93 Difference]: Finished difference Result 439 states and 622 transitions. [2025-02-06 03:18:47,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-06 03:18:47,348 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.142857142857142) internal successors, (71), 7 states have internal predecessors, (71), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 158 [2025-02-06 03:18:47,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:18:47,350 INFO L225 Difference]: With dead ends: 439 [2025-02-06 03:18:47,350 INFO L226 Difference]: Without dead ends: 293 [2025-02-06 03:18:47,350 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2025-02-06 03:18:47,351 INFO L435 NwaCegarLoop]: 217 mSDtfsCounter, 128 mSDsluCounter, 815 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 128 SdHoareTripleChecker+Valid, 1032 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 03:18:47,351 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [128 Valid, 1032 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 03:18:47,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 293 states. [2025-02-06 03:18:47,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 293 to 287. [2025-02-06 03:18:47,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 287 states, 246 states have (on average 1.3658536585365855) internal successors, (336), 246 states have internal predecessors, (336), 36 states have call successors, (36), 4 states have call predecessors, (36), 4 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2025-02-06 03:18:47,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 287 states to 287 states and 408 transitions. [2025-02-06 03:18:47,365 INFO L78 Accepts]: Start accepts. Automaton has 287 states and 408 transitions. Word has length 158 [2025-02-06 03:18:47,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:18:47,365 INFO L471 AbstractCegarLoop]: Abstraction has 287 states and 408 transitions. [2025-02-06 03:18:47,365 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.142857142857142) internal successors, (71), 7 states have internal predecessors, (71), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-02-06 03:18:47,366 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 408 transitions. [2025-02-06 03:18:47,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2025-02-06 03:18:47,366 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:18:47,367 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-06 03:18:47,367 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-06 03:18:47,367 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:18:47,367 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:18:47,367 INFO L85 PathProgramCache]: Analyzing trace with hash 321726336, now seen corresponding path program 1 times [2025-02-06 03:18:47,367 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:18:47,367 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1709105988] [2025-02-06 03:18:47,368 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:18:47,368 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:18:47,385 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 160 statements into 1 equivalence classes. [2025-02-06 03:18:47,400 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 160 of 160 statements. [2025-02-06 03:18:47,400 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:18:47,401 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:18:47,884 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-02-06 03:18:47,884 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:18:47,884 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1709105988] [2025-02-06 03:18:47,885 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1709105988] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:18:47,885 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:18:47,885 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 03:18:47,885 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1326737252] [2025-02-06 03:18:47,885 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:18:47,885 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 03:18:47,885 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:18:47,886 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 03:18:47,886 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-06 03:18:47,886 INFO L87 Difference]: Start difference. First operand 287 states and 408 transitions. Second operand has 6 states, 5 states have (on average 14.6) internal successors, (73), 6 states have internal predecessors, (73), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2025-02-06 03:18:48,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:18:48,016 INFO L93 Difference]: Finished difference Result 570 states and 809 transitions. [2025-02-06 03:18:48,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-06 03:18:48,017 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 14.6) internal successors, (73), 6 states have internal predecessors, (73), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) Word has length 160 [2025-02-06 03:18:48,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:18:48,018 INFO L225 Difference]: With dead ends: 570 [2025-02-06 03:18:48,019 INFO L226 Difference]: Without dead ends: 423 [2025-02-06 03:18:48,019 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2025-02-06 03:18:48,019 INFO L435 NwaCegarLoop]: 371 mSDtfsCounter, 171 mSDsluCounter, 1056 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 172 SdHoareTripleChecker+Valid, 1427 SdHoareTripleChecker+Invalid, 102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 03:18:48,019 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [172 Valid, 1427 Invalid, 102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 03:18:48,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 423 states. [2025-02-06 03:18:48,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 423 to 312. [2025-02-06 03:18:48,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 312 states, 271 states have (on average 1.3763837638376384) internal successors, (373), 271 states have internal predecessors, (373), 36 states have call successors, (36), 4 states have call predecessors, (36), 4 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2025-02-06 03:18:48,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 312 states to 312 states and 445 transitions. [2025-02-06 03:18:48,039 INFO L78 Accepts]: Start accepts. Automaton has 312 states and 445 transitions. Word has length 160 [2025-02-06 03:18:48,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:18:48,040 INFO L471 AbstractCegarLoop]: Abstraction has 312 states and 445 transitions. [2025-02-06 03:18:48,040 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 14.6) internal successors, (73), 6 states have internal predecessors, (73), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2025-02-06 03:18:48,040 INFO L276 IsEmpty]: Start isEmpty. Operand 312 states and 445 transitions. [2025-02-06 03:18:48,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2025-02-06 03:18:48,041 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:18:48,041 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-06 03:18:48,041 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-06 03:18:48,041 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:18:48,041 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:18:48,041 INFO L85 PathProgramCache]: Analyzing trace with hash 672526273, now seen corresponding path program 1 times [2025-02-06 03:18:48,042 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:18:48,042 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [413962163] [2025-02-06 03:18:48,042 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:18:48,042 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:18:48,058 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 160 statements into 1 equivalence classes. [2025-02-06 03:18:48,073 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 160 of 160 statements. [2025-02-06 03:18:48,073 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:18:48,073 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:18:48,501 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-02-06 03:18:48,501 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:18:48,501 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [413962163] [2025-02-06 03:18:48,502 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [413962163] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:18:48,502 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:18:48,502 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-06 03:18:48,502 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1147434520] [2025-02-06 03:18:48,502 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:18:48,502 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-06 03:18:48,502 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:18:48,503 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-06 03:18:48,503 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-02-06 03:18:48,503 INFO L87 Difference]: Start difference. First operand 312 states and 445 transitions. Second operand has 8 states, 8 states have (on average 9.125) internal successors, (73), 8 states have internal predecessors, (73), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-02-06 03:18:48,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:18:48,624 INFO L93 Difference]: Finished difference Result 628 states and 895 transitions. [2025-02-06 03:18:48,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-02-06 03:18:48,624 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.125) internal successors, (73), 8 states have internal predecessors, (73), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 160 [2025-02-06 03:18:48,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:18:48,626 INFO L225 Difference]: With dead ends: 628 [2025-02-06 03:18:48,626 INFO L226 Difference]: Without dead ends: 457 [2025-02-06 03:18:48,627 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2025-02-06 03:18:48,627 INFO L435 NwaCegarLoop]: 185 mSDtfsCounter, 182 mSDsluCounter, 909 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 182 SdHoareTripleChecker+Valid, 1094 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 03:18:48,627 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [182 Valid, 1094 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 03:18:48,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 457 states. [2025-02-06 03:18:48,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 457 to 312. [2025-02-06 03:18:48,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 312 states, 271 states have (on average 1.3763837638376384) internal successors, (373), 271 states have internal predecessors, (373), 36 states have call successors, (36), 4 states have call predecessors, (36), 4 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2025-02-06 03:18:48,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 312 states to 312 states and 445 transitions. [2025-02-06 03:18:48,659 INFO L78 Accepts]: Start accepts. Automaton has 312 states and 445 transitions. Word has length 160 [2025-02-06 03:18:48,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:18:48,659 INFO L471 AbstractCegarLoop]: Abstraction has 312 states and 445 transitions. [2025-02-06 03:18:48,659 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.125) internal successors, (73), 8 states have internal predecessors, (73), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-02-06 03:18:48,659 INFO L276 IsEmpty]: Start isEmpty. Operand 312 states and 445 transitions. [2025-02-06 03:18:48,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2025-02-06 03:18:48,660 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:18:48,660 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-06 03:18:48,660 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-06 03:18:48,660 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:18:48,661 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:18:48,661 INFO L85 PathProgramCache]: Analyzing trace with hash 1981523534, now seen corresponding path program 1 times [2025-02-06 03:18:48,661 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:18:48,661 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1572273520] [2025-02-06 03:18:48,661 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:18:48,661 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:18:48,682 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 160 statements into 1 equivalence classes. [2025-02-06 03:18:48,701 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 160 of 160 statements. [2025-02-06 03:18:48,702 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:18:48,702 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:18:49,131 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-02-06 03:18:49,131 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:18:49,131 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1572273520] [2025-02-06 03:18:49,131 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1572273520] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:18:49,131 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:18:49,131 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 03:18:49,131 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1278125249] [2025-02-06 03:18:49,131 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:18:49,131 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 03:18:49,131 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:18:49,132 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 03:18:49,132 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-06 03:18:49,132 INFO L87 Difference]: Start difference. First operand 312 states and 445 transitions. Second operand has 6 states, 5 states have (on average 14.6) internal successors, (73), 6 states have internal predecessors, (73), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2025-02-06 03:18:49,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:18:49,272 INFO L93 Difference]: Finished difference Result 691 states and 984 transitions. [2025-02-06 03:18:49,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 03:18:49,272 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 14.6) internal successors, (73), 6 states have internal predecessors, (73), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) Word has length 160 [2025-02-06 03:18:49,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:18:49,274 INFO L225 Difference]: With dead ends: 691 [2025-02-06 03:18:49,274 INFO L226 Difference]: Without dead ends: 382 [2025-02-06 03:18:49,275 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 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-02-06 03:18:49,275 INFO L435 NwaCegarLoop]: 278 mSDtfsCounter, 167 mSDsluCounter, 871 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 168 SdHoareTripleChecker+Valid, 1149 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 03:18:49,275 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [168 Valid, 1149 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 03:18:49,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 382 states. [2025-02-06 03:18:49,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 382 to 381. [2025-02-06 03:18:49,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 381 states, 321 states have (on average 1.355140186915888) internal successors, (435), 322 states have internal predecessors, (435), 52 states have call successors, (52), 7 states have call predecessors, (52), 7 states have return successors, (52), 51 states have call predecessors, (52), 52 states have call successors, (52) [2025-02-06 03:18:49,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 539 transitions. [2025-02-06 03:18:49,315 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 539 transitions. Word has length 160 [2025-02-06 03:18:49,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:18:49,316 INFO L471 AbstractCegarLoop]: Abstraction has 381 states and 539 transitions. [2025-02-06 03:18:49,316 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 14.6) internal successors, (73), 6 states have internal predecessors, (73), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2025-02-06 03:18:49,316 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 539 transitions. [2025-02-06 03:18:49,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2025-02-06 03:18:49,317 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:18:49,317 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-06 03:18:49,317 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-06 03:18:49,317 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:18:49,317 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:18:49,317 INFO L85 PathProgramCache]: Analyzing trace with hash 1688120527, now seen corresponding path program 1 times [2025-02-06 03:18:49,317 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:18:49,317 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1486660981] [2025-02-06 03:18:49,317 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:18:49,317 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:18:49,337 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 160 statements into 1 equivalence classes. [2025-02-06 03:18:49,345 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 160 of 160 statements. [2025-02-06 03:18:49,345 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:18:49,345 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:18:49,573 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-02-06 03:18:49,574 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:18:49,574 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1486660981] [2025-02-06 03:18:49,574 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1486660981] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:18:49,574 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:18:49,574 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 03:18:49,574 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [641749357] [2025-02-06 03:18:49,574 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:18:49,575 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 03:18:49,575 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:18:49,575 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 03:18:49,575 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-06 03:18:49,575 INFO L87 Difference]: Start difference. First operand 381 states and 539 transitions. Second operand has 6 states, 6 states have (on average 12.166666666666666) internal successors, (73), 6 states have internal predecessors, (73), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-02-06 03:18:49,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:18:49,775 INFO L93 Difference]: Finished difference Result 960 states and 1344 transitions. [2025-02-06 03:18:49,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 03:18:49,776 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.166666666666666) internal successors, (73), 6 states have internal predecessors, (73), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 160 [2025-02-06 03:18:49,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:18:49,780 INFO L225 Difference]: With dead ends: 960 [2025-02-06 03:18:49,780 INFO L226 Difference]: Without dead ends: 639 [2025-02-06 03:18:49,781 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-02-06 03:18:49,781 INFO L435 NwaCegarLoop]: 255 mSDtfsCounter, 144 mSDsluCounter, 889 mSDsCounter, 0 mSdLazyCounter, 219 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 144 SdHoareTripleChecker+Valid, 1144 SdHoareTripleChecker+Invalid, 224 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 219 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 03:18:49,782 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [144 Valid, 1144 Invalid, 224 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 219 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 03:18:49,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 639 states. [2025-02-06 03:18:49,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 639 to 523. [2025-02-06 03:18:49,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 523 states, 442 states have (on average 1.341628959276018) internal successors, (593), 444 states have internal predecessors, (593), 70 states have call successors, (70), 10 states have call predecessors, (70), 10 states have return successors, (70), 68 states have call predecessors, (70), 70 states have call successors, (70) [2025-02-06 03:18:49,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 523 states to 523 states and 733 transitions. [2025-02-06 03:18:49,829 INFO L78 Accepts]: Start accepts. Automaton has 523 states and 733 transitions. Word has length 160 [2025-02-06 03:18:49,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:18:49,831 INFO L471 AbstractCegarLoop]: Abstraction has 523 states and 733 transitions. [2025-02-06 03:18:49,831 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.166666666666666) internal successors, (73), 6 states have internal predecessors, (73), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-02-06 03:18:49,831 INFO L276 IsEmpty]: Start isEmpty. Operand 523 states and 733 transitions. [2025-02-06 03:18:49,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2025-02-06 03:18:49,832 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:18:49,832 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-06 03:18:49,832 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-06 03:18:49,832 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:18:49,832 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:18:49,832 INFO L85 PathProgramCache]: Analyzing trace with hash 189494589, now seen corresponding path program 1 times [2025-02-06 03:18:49,832 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:18:49,832 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [366205673] [2025-02-06 03:18:49,832 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:18:49,832 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:18:49,853 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 163 statements into 1 equivalence classes. [2025-02-06 03:18:49,869 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 163 of 163 statements. [2025-02-06 03:18:49,869 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:18:49,869 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:18:50,598 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-02-06 03:18:50,598 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:18:50,599 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [366205673] [2025-02-06 03:18:50,599 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [366205673] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:18:50,599 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:18:50,599 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-06 03:18:50,599 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1614270985] [2025-02-06 03:18:50,599 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:18:50,599 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-06 03:18:50,599 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:18:50,600 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-06 03:18:50,600 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-02-06 03:18:50,600 INFO L87 Difference]: Start difference. First operand 523 states and 733 transitions. Second operand has 7 states, 6 states have (on average 12.666666666666666) internal successors, (76), 7 states have internal predecessors, (76), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2025-02-06 03:18:50,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:18:50,782 INFO L93 Difference]: Finished difference Result 534 states and 746 transitions. [2025-02-06 03:18:50,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-06 03:18:50,783 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 12.666666666666666) internal successors, (76), 7 states have internal predecessors, (76), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) Word has length 163 [2025-02-06 03:18:50,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:18:50,785 INFO L225 Difference]: With dead ends: 534 [2025-02-06 03:18:50,785 INFO L226 Difference]: Without dead ends: 532 [2025-02-06 03:18:50,786 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2025-02-06 03:18:50,787 INFO L435 NwaCegarLoop]: 188 mSDtfsCounter, 75 mSDsluCounter, 826 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 1014 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 03:18:50,787 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 1014 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 03:18:50,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 532 states. [2025-02-06 03:18:50,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 532 to 532. [2025-02-06 03:18:50,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 532 states, 451 states have (on average 1.334811529933481) internal successors, (602), 453 states have internal predecessors, (602), 70 states have call successors, (70), 10 states have call predecessors, (70), 10 states have return successors, (70), 68 states have call predecessors, (70), 70 states have call successors, (70) [2025-02-06 03:18:50,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 532 states to 532 states and 742 transitions. [2025-02-06 03:18:50,830 INFO L78 Accepts]: Start accepts. Automaton has 532 states and 742 transitions. Word has length 163 [2025-02-06 03:18:50,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:18:50,831 INFO L471 AbstractCegarLoop]: Abstraction has 532 states and 742 transitions. [2025-02-06 03:18:50,831 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 12.666666666666666) internal successors, (76), 7 states have internal predecessors, (76), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2025-02-06 03:18:50,831 INFO L276 IsEmpty]: Start isEmpty. Operand 532 states and 742 transitions. [2025-02-06 03:18:50,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2025-02-06 03:18:50,832 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:18:50,832 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-06 03:18:50,832 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-06 03:18:50,832 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:18:50,833 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:18:50,833 INFO L85 PathProgramCache]: Analyzing trace with hash 190418110, now seen corresponding path program 1 times [2025-02-06 03:18:50,833 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:18:50,833 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1832915713] [2025-02-06 03:18:50,833 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:18:50,833 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:18:50,860 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 163 statements into 1 equivalence classes. [2025-02-06 03:18:50,867 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 163 of 163 statements. [2025-02-06 03:18:50,867 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:18:50,867 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:18:51,019 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-02-06 03:18:51,019 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:18:51,019 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1832915713] [2025-02-06 03:18:51,019 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1832915713] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:18:51,019 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:18:51,019 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 03:18:51,019 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1431562650] [2025-02-06 03:18:51,019 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:18:51,019 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 03:18:51,019 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:18:51,020 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 03:18:51,020 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 03:18:51,020 INFO L87 Difference]: Start difference. First operand 532 states and 742 transitions. Second operand has 5 states, 5 states have (on average 15.2) internal successors, (76), 5 states have internal predecessors, (76), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-02-06 03:18:51,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:18:51,157 INFO L93 Difference]: Finished difference Result 1020 states and 1409 transitions. [2025-02-06 03:18:51,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 03:18:51,158 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.2) internal successors, (76), 5 states have internal predecessors, (76), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 163 [2025-02-06 03:18:51,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:18:51,160 INFO L225 Difference]: With dead ends: 1020 [2025-02-06 03:18:51,160 INFO L226 Difference]: Without dead ends: 548 [2025-02-06 03:18:51,160 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-02-06 03:18:51,161 INFO L435 NwaCegarLoop]: 148 mSDtfsCounter, 133 mSDsluCounter, 313 mSDsCounter, 0 mSdLazyCounter, 163 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 133 SdHoareTripleChecker+Valid, 461 SdHoareTripleChecker+Invalid, 166 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 163 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 03:18:51,161 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [133 Valid, 461 Invalid, 166 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 163 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 03:18:51,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 548 states. [2025-02-06 03:18:51,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 548 to 548. [2025-02-06 03:18:51,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 548 states, 463 states have (on average 1.3196544276457884) internal successors, (611), 465 states have internal predecessors, (611), 70 states have call successors, (70), 14 states have call predecessors, (70), 14 states have return successors, (70), 68 states have call predecessors, (70), 70 states have call successors, (70) [2025-02-06 03:18:51,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 548 states to 548 states and 751 transitions. [2025-02-06 03:18:51,229 INFO L78 Accepts]: Start accepts. Automaton has 548 states and 751 transitions. Word has length 163 [2025-02-06 03:18:51,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:18:51,230 INFO L471 AbstractCegarLoop]: Abstraction has 548 states and 751 transitions. [2025-02-06 03:18:51,230 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.2) internal successors, (76), 5 states have internal predecessors, (76), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-02-06 03:18:51,230 INFO L276 IsEmpty]: Start isEmpty. Operand 548 states and 751 transitions. [2025-02-06 03:18:51,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2025-02-06 03:18:51,231 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:18:51,231 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-06 03:18:51,232 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-06 03:18:51,232 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:18:51,232 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:18:51,232 INFO L85 PathProgramCache]: Analyzing trace with hash 1077921791, now seen corresponding path program 1 times [2025-02-06 03:18:51,232 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:18:51,232 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1490728469] [2025-02-06 03:18:51,232 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:18:51,232 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:18:51,252 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 163 statements into 1 equivalence classes. [2025-02-06 03:18:51,261 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 163 of 163 statements. [2025-02-06 03:18:51,261 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:18:51,261 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:18:51,374 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-02-06 03:18:51,374 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:18:51,374 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1490728469] [2025-02-06 03:18:51,374 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1490728469] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:18:51,374 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:18:51,374 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 03:18:51,375 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [545523361] [2025-02-06 03:18:51,375 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:18:51,375 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 03:18:51,375 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:18:51,376 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 03:18:51,376 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 03:18:51,376 INFO L87 Difference]: Start difference. First operand 548 states and 751 transitions. Second operand has 5 states, 5 states have (on average 15.2) internal successors, (76), 5 states have internal predecessors, (76), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-02-06 03:18:51,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:18:51,448 INFO L93 Difference]: Finished difference Result 1032 states and 1412 transitions. [2025-02-06 03:18:51,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 03:18:51,448 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.2) internal successors, (76), 5 states have internal predecessors, (76), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 163 [2025-02-06 03:18:51,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:18:51,451 INFO L225 Difference]: With dead ends: 1032 [2025-02-06 03:18:51,452 INFO L226 Difference]: Without dead ends: 548 [2025-02-06 03:18:51,453 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-02-06 03:18:51,454 INFO L435 NwaCegarLoop]: 188 mSDtfsCounter, 167 mSDsluCounter, 366 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 167 SdHoareTripleChecker+Valid, 554 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 03:18:51,454 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [167 Valid, 554 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 03:18:51,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 548 states. [2025-02-06 03:18:51,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 548 to 548. [2025-02-06 03:18:51,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 548 states, 463 states have (on average 1.3131749460043196) internal successors, (608), 465 states have internal predecessors, (608), 70 states have call successors, (70), 14 states have call predecessors, (70), 14 states have return successors, (70), 68 states have call predecessors, (70), 70 states have call successors, (70) [2025-02-06 03:18:51,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 548 states to 548 states and 748 transitions. [2025-02-06 03:18:51,496 INFO L78 Accepts]: Start accepts. Automaton has 548 states and 748 transitions. Word has length 163 [2025-02-06 03:18:51,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:18:51,497 INFO L471 AbstractCegarLoop]: Abstraction has 548 states and 748 transitions. [2025-02-06 03:18:51,497 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.2) internal successors, (76), 5 states have internal predecessors, (76), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-02-06 03:18:51,497 INFO L276 IsEmpty]: Start isEmpty. Operand 548 states and 748 transitions. [2025-02-06 03:18:51,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2025-02-06 03:18:51,498 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:18:51,498 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-06 03:18:51,499 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-06 03:18:51,499 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:18:51,499 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:18:51,499 INFO L85 PathProgramCache]: Analyzing trace with hash -729532672, now seen corresponding path program 1 times [2025-02-06 03:18:51,499 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:18:51,499 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [462562572] [2025-02-06 03:18:51,499 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:18:51,499 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:18:51,517 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 163 statements into 1 equivalence classes. [2025-02-06 03:18:51,523 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 163 of 163 statements. [2025-02-06 03:18:51,523 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:18:51,523 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:18:51,610 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 561 trivial. 0 not checked. [2025-02-06 03:18:51,610 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 03:18:51,610 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [462562572] [2025-02-06 03:18:51,610 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [462562572] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 03:18:51,610 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [601450730] [2025-02-06 03:18:51,610 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:18:51,610 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 03:18:51,611 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 03:18:51,612 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 03:18:51,614 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-02-06 03:18:51,820 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 163 statements into 1 equivalence classes. [2025-02-06 03:18:51,875 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 163 of 163 statements. [2025-02-06 03:18:51,875 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:18:51,875 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:18:51,878 INFO L256 TraceCheckSpWp]: Trace formula consists of 587 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-06 03:18:51,882 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:18:51,900 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-02-06 03:18:51,900 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 03:18:51,900 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [601450730] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:18:51,900 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 03:18:51,900 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 8 [2025-02-06 03:18:51,900 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1616799140] [2025-02-06 03:18:51,900 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:18:51,901 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 03:18:51,901 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 03:18:51,901 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 03:18:51,902 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-02-06 03:18:51,902 INFO L87 Difference]: Start difference. First operand 548 states and 748 transitions. Second operand has 5 states, 5 states have (on average 15.2) internal successors, (76), 5 states have internal predecessors, (76), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-02-06 03:18:51,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:18:51,965 INFO L93 Difference]: Finished difference Result 1041 states and 1418 transitions. [2025-02-06 03:18:51,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 03:18:51,965 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.2) internal successors, (76), 5 states have internal predecessors, (76), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 163 [2025-02-06 03:18:51,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:18:51,968 INFO L225 Difference]: With dead ends: 1041 [2025-02-06 03:18:51,968 INFO L226 Difference]: Without dead ends: 557 [2025-02-06 03:18:51,969 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 164 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-02-06 03:18:51,969 INFO L435 NwaCegarLoop]: 194 mSDtfsCounter, 0 mSDsluCounter, 566 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 760 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 03:18:51,970 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 760 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 03:18:51,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 557 states. [2025-02-06 03:18:52,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 557 to 557. [2025-02-06 03:18:52,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 557 states, 472 states have (on average 1.3072033898305084) internal successors, (617), 474 states have internal predecessors, (617), 70 states have call successors, (70), 14 states have call predecessors, (70), 14 states have return successors, (70), 68 states have call predecessors, (70), 70 states have call successors, (70) [2025-02-06 03:18:52,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 557 states to 557 states and 757 transitions. [2025-02-06 03:18:52,031 INFO L78 Accepts]: Start accepts. Automaton has 557 states and 757 transitions. Word has length 163 [2025-02-06 03:18:52,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:18:52,031 INFO L471 AbstractCegarLoop]: Abstraction has 557 states and 757 transitions. [2025-02-06 03:18:52,032 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.2) internal successors, (76), 5 states have internal predecessors, (76), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-02-06 03:18:52,032 INFO L276 IsEmpty]: Start isEmpty. Operand 557 states and 757 transitions. [2025-02-06 03:18:52,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2025-02-06 03:18:52,033 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:18:52,033 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-06 03:18:52,041 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-02-06 03:18:52,237 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2025-02-06 03:18:52,237 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:18:52,238 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:18:52,238 INFO L85 PathProgramCache]: Analyzing trace with hash 966402946, now seen corresponding path program 1 times [2025-02-06 03:18:52,238 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 03:18:52,238 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [193579048] [2025-02-06 03:18:52,238 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:18:52,239 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 03:18:52,263 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 167 statements into 1 equivalence classes. [2025-02-06 03:18:52,301 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 167 of 167 statements. [2025-02-06 03:18:52,302 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:18:52,302 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 03:18:52,302 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 03:18:52,309 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 167 statements into 1 equivalence classes. [2025-02-06 03:18:52,339 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 167 of 167 statements. [2025-02-06 03:18:52,339 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:18:52,339 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 03:18:52,399 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 03:18:52,399 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-06 03:18:52,401 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-02-06 03:18:52,402 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-02-06 03:18:52,406 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 03:18:52,491 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-06 03:18:52,493 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.02 03:18:52 BoogieIcfgContainer [2025-02-06 03:18:52,493 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-06 03:18:52,494 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-06 03:18:52,494 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-06 03:18:52,494 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-06 03:18:52,494 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 03:18:40" (3/4) ... [2025-02-06 03:18:52,496 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-02-06 03:18:52,496 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-06 03:18:52,497 INFO L158 Benchmark]: Toolchain (without parser) took 13403.53ms. Allocated memory was 142.6MB in the beginning and 595.6MB in the end (delta: 453.0MB). Free memory was 106.1MB in the beginning and 406.1MB in the end (delta: -300.0MB). Peak memory consumption was 153.7MB. Max. memory is 16.1GB. [2025-02-06 03:18:52,497 INFO L158 Benchmark]: CDTParser took 1.16ms. Allocated memory is still 201.3MB. Free memory is still 129.3MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 03:18:52,497 INFO L158 Benchmark]: CACSL2BoogieTranslator took 242.77ms. Allocated memory is still 142.6MB. Free memory was 106.1MB in the beginning and 89.4MB in the end (delta: 16.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-02-06 03:18:52,497 INFO L158 Benchmark]: Boogie Procedure Inliner took 51.30ms. Allocated memory is still 142.6MB. Free memory was 89.4MB in the beginning and 85.9MB in the end (delta: 3.5MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 03:18:52,497 INFO L158 Benchmark]: Boogie Preprocessor took 50.93ms. Allocated memory is still 142.6MB. Free memory was 85.9MB in the beginning and 81.0MB in the end (delta: 4.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-06 03:18:52,497 INFO L158 Benchmark]: IcfgBuilder took 743.21ms. Allocated memory is still 142.6MB. Free memory was 81.0MB in the beginning and 41.0MB in the end (delta: 40.0MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. [2025-02-06 03:18:52,497 INFO L158 Benchmark]: TraceAbstraction took 12305.18ms. Allocated memory was 142.6MB in the beginning and 595.6MB in the end (delta: 453.0MB). Free memory was 41.0MB in the beginning and 406.1MB in the end (delta: -365.1MB). Peak memory consumption was 86.6MB. Max. memory is 16.1GB. [2025-02-06 03:18:52,498 INFO L158 Benchmark]: Witness Printer took 2.61ms. Allocated memory is still 595.6MB. Free memory was 406.1MB in the beginning and 406.1MB in the end (delta: 64.5kB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 03:18:52,498 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.16ms. Allocated memory is still 201.3MB. Free memory is still 129.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 242.77ms. Allocated memory is still 142.6MB. Free memory was 106.1MB in the beginning and 89.4MB in the end (delta: 16.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 51.30ms. Allocated memory is still 142.6MB. Free memory was 89.4MB in the beginning and 85.9MB in the end (delta: 3.5MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 50.93ms. Allocated memory is still 142.6MB. Free memory was 85.9MB in the beginning and 81.0MB in the end (delta: 4.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 743.21ms. Allocated memory is still 142.6MB. Free memory was 81.0MB in the beginning and 41.0MB in the end (delta: 40.0MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. * TraceAbstraction took 12305.18ms. Allocated memory was 142.6MB in the beginning and 595.6MB in the end (delta: 453.0MB). Free memory was 41.0MB in the beginning and 406.1MB in the end (delta: -365.1MB). Peak memory consumption was 86.6MB. Max. memory is 16.1GB. * Witness Printer took 2.61ms. Allocated memory is still 595.6MB. Free memory was 406.1MB in the beginning and 406.1MB in the end (delta: 64.5kB). 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 someBinaryFLOATComparisonOperation at line 72, overapproximation of someBinaryFLOATComparisonOperation at line 66, overapproximation of someBinaryFLOATComparisonOperation at line 96, overapproximation of someBinaryFLOATComparisonOperation at line 68, overapproximation of someBinaryFLOATComparisonOperation at line 72, overapproximation of someBinaryFLOATComparisonOperation at line 55, overapproximation of someBinaryFLOATComparisonOperation at line 96, overapproximation of someBinaryFLOATComparisonOperation at line 70, overapproximation of someBinaryFLOATComparisonOperation at line 48, overapproximation of someBinaryFLOATComparisonOperation at line 96, overapproximation of someBinaryFLOATComparisonOperation at line 68, overapproximation of someBinaryFLOATComparisonOperation at line 55, overapproximation of someBinaryFLOATComparisonOperation at line 70, overapproximation of someBinaryFLOATComparisonOperation at line 48, overapproximation of someBinaryFLOATComparisonOperation at line 96, overapproximation of someBinaryFLOATComparisonOperation at line 66. 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] float float_Array_0[2][2] = { {9.8, 2.25}, {10.3, 8.3} }; [L25-L27] float float_Array_0[2][2] = { {9.8, 2.25}, {10.3, 8.3} }; [L25-L27] float float_Array_0[2][2] = { {9.8, 2.25}, {10.3, 8.3} }; [L25-L27] float float_Array_0[2][2] = { {9.8, 2.25}, {10.3, 8.3} }; [L25-L27] float float_Array_0[2][2] = { {9.8, 2.25}, {10.3, 8.3} }; [L28-L30] signed char signed_char_Array_0[7] = { 32, 16, 16, 25, -10, 1, 0 }; [L28-L30] signed char signed_char_Array_0[7] = { 32, 16, 16, 25, -10, 1, 0 }; [L28-L30] signed char signed_char_Array_0[7] = { 32, 16, 16, 25, -10, 1, 0 }; [L28-L30] signed char signed_char_Array_0[7] = { 32, 16, 16, 25, -10, 1, 0 }; [L28-L30] signed char signed_char_Array_0[7] = { 32, 16, 16, 25, -10, 1, 0 }; [L28-L30] signed char signed_char_Array_0[7] = { 32, 16, 16, 25, -10, 1, 0 }; [L28-L30] signed char signed_char_Array_0[7] = { 32, 16, 16, 25, -10, 1, 0 }; [L28-L30] signed char signed_char_Array_0[7] = { 32, 16, 16, 25, -10, 1, 0 }; [L31-L33] signed long int signed_long_int_Array_0[1] = { 128 }; [L31-L33] signed long int signed_long_int_Array_0[1] = { 128 }; [L34-L36] signed short int signed_short_int_Array_0[1] = { 256 }; [L34-L36] signed short int signed_short_int_Array_0[1] = { 256 }; [L37-L39] unsigned long int unsigned_long_int_Array_0[2] = { 1, 32 }; [L37-L39] unsigned long int unsigned_long_int_Array_0[2] = { 1, 32 }; [L37-L39] unsigned long int unsigned_long_int_Array_0[2] = { 1, 32 }; [L40] signed short int last_1_signed_short_int_Array_0_0_ = 256; VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=0, last_1_signed_short_int_Array_0_0_=256, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L100] isInitial = 1 [L101] FCALL initially() [L102] COND TRUE 1 [L103] CALL updateLastVariables() [L93] EXPR signed_short_int_Array_0[0] [L93] last_1_signed_short_int_Array_0_0_ = signed_short_int_Array_0[0] [L103] RET updateLastVariables() [L104] CALL updateVariables() [L62] BOOL_unsigned_char_Array_0[1] = __VERIFIER_nondet_uchar() [L63] EXPR BOOL_unsigned_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=256, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L63] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[1] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=256, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=256, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L63] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[1] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=256, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L64] EXPR BOOL_unsigned_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=256, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_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, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=256, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=256, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_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}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=256, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L65] float_Array_0[0][0] = __VERIFIER_nondet_float() [L66] EXPR float_Array_0[0][0] [L66] EXPR float_Array_0[0][0] >= -922337.2036854776000e+13F && float_Array_0[0][0] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=256, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L66] EXPR float_Array_0[0][0] >= -922337.2036854776000e+13F && float_Array_0[0][0] <= -1.0e-20F [L66] EXPR float_Array_0[0][0] [L66] EXPR float_Array_0[0][0] >= -922337.2036854776000e+13F && float_Array_0[0][0] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=256, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L66] EXPR (float_Array_0[0][0] >= -922337.2036854776000e+13F && float_Array_0[0][0] <= -1.0e-20F) || (float_Array_0[0][0] <= 9223372.036854776000e+12F && float_Array_0[0][0] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=256, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L66] EXPR (float_Array_0[0][0] >= -922337.2036854776000e+13F && float_Array_0[0][0] <= -1.0e-20F) || (float_Array_0[0][0] <= 9223372.036854776000e+12F && float_Array_0[0][0] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=256, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L66] CALL assume_abort_if_not((float_Array_0[0][0] >= -922337.2036854776000e+13F && float_Array_0[0][0] <= -1.0e-20F) || (float_Array_0[0][0] <= 9223372.036854776000e+12F && float_Array_0[0][0] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=256, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=256, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L66] RET assume_abort_if_not((float_Array_0[0][0] >= -922337.2036854776000e+13F && float_Array_0[0][0] <= -1.0e-20F) || (float_Array_0[0][0] <= 9223372.036854776000e+12F && float_Array_0[0][0] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=256, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L67] float_Array_0[1][0] = __VERIFIER_nondet_float() [L68] EXPR float_Array_0[1][0] [L68] EXPR float_Array_0[1][0] >= -922337.2036854776000e+13F && float_Array_0[1][0] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=256, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L68] EXPR float_Array_0[1][0] >= -922337.2036854776000e+13F && float_Array_0[1][0] <= -1.0e-20F [L68] EXPR float_Array_0[1][0] [L68] EXPR float_Array_0[1][0] >= -922337.2036854776000e+13F && float_Array_0[1][0] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=256, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L68] EXPR (float_Array_0[1][0] >= -922337.2036854776000e+13F && float_Array_0[1][0] <= -1.0e-20F) || (float_Array_0[1][0] <= 9223372.036854776000e+12F && float_Array_0[1][0] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=256, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L68] EXPR (float_Array_0[1][0] >= -922337.2036854776000e+13F && float_Array_0[1][0] <= -1.0e-20F) || (float_Array_0[1][0] <= 9223372.036854776000e+12F && float_Array_0[1][0] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=256, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L68] CALL assume_abort_if_not((float_Array_0[1][0] >= -922337.2036854776000e+13F && float_Array_0[1][0] <= -1.0e-20F) || (float_Array_0[1][0] <= 9223372.036854776000e+12F && float_Array_0[1][0] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=256, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=256, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L68] RET assume_abort_if_not((float_Array_0[1][0] >= -922337.2036854776000e+13F && float_Array_0[1][0] <= -1.0e-20F) || (float_Array_0[1][0] <= 9223372.036854776000e+12F && float_Array_0[1][0] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=256, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L69] float_Array_0[0][1] = __VERIFIER_nondet_float() [L70] EXPR float_Array_0[0][1] [L70] EXPR float_Array_0[0][1] >= -922337.2036854776000e+13F && float_Array_0[0][1] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=256, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L70] EXPR float_Array_0[0][1] >= -922337.2036854776000e+13F && float_Array_0[0][1] <= -1.0e-20F [L70] EXPR float_Array_0[0][1] [L70] EXPR float_Array_0[0][1] >= -922337.2036854776000e+13F && float_Array_0[0][1] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=256, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L70] EXPR (float_Array_0[0][1] >= -922337.2036854776000e+13F && float_Array_0[0][1] <= -1.0e-20F) || (float_Array_0[0][1] <= 9223372.036854776000e+12F && float_Array_0[0][1] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=256, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L70] EXPR (float_Array_0[0][1] >= -922337.2036854776000e+13F && float_Array_0[0][1] <= -1.0e-20F) || (float_Array_0[0][1] <= 9223372.036854776000e+12F && float_Array_0[0][1] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=256, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L70] CALL assume_abort_if_not((float_Array_0[0][1] >= -922337.2036854776000e+13F && float_Array_0[0][1] <= -1.0e-20F) || (float_Array_0[0][1] <= 9223372.036854776000e+12F && float_Array_0[0][1] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=256, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=256, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L70] RET assume_abort_if_not((float_Array_0[0][1] >= -922337.2036854776000e+13F && float_Array_0[0][1] <= -1.0e-20F) || (float_Array_0[0][1] <= 9223372.036854776000e+12F && float_Array_0[0][1] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=256, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L71] float_Array_0[1][1] = __VERIFIER_nondet_float() [L72] EXPR float_Array_0[1][1] [L72] EXPR float_Array_0[1][1] >= -922337.2036854776000e+13F && float_Array_0[1][1] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=256, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L72] EXPR float_Array_0[1][1] >= -922337.2036854776000e+13F && float_Array_0[1][1] <= -1.0e-20F [L72] EXPR float_Array_0[1][1] [L72] EXPR float_Array_0[1][1] >= -922337.2036854776000e+13F && float_Array_0[1][1] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=256, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L72] EXPR (float_Array_0[1][1] >= -922337.2036854776000e+13F && float_Array_0[1][1] <= -1.0e-20F) || (float_Array_0[1][1] <= 9223372.036854776000e+12F && float_Array_0[1][1] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=256, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L72] EXPR (float_Array_0[1][1] >= -922337.2036854776000e+13F && float_Array_0[1][1] <= -1.0e-20F) || (float_Array_0[1][1] <= 9223372.036854776000e+12F && float_Array_0[1][1] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=256, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L72] CALL assume_abort_if_not((float_Array_0[1][1] >= -922337.2036854776000e+13F && float_Array_0[1][1] <= -1.0e-20F) || (float_Array_0[1][1] <= 9223372.036854776000e+12F && float_Array_0[1][1] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=256, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=256, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L72] RET assume_abort_if_not((float_Array_0[1][1] >= -922337.2036854776000e+13F && float_Array_0[1][1] <= -1.0e-20F) || (float_Array_0[1][1] <= 9223372.036854776000e+12F && float_Array_0[1][1] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=256, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L73] signed_char_Array_0[0] = __VERIFIER_nondet_char() [L74] EXPR signed_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=256, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L74] CALL assume_abort_if_not(signed_char_Array_0[0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=256, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=256, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L74] RET assume_abort_if_not(signed_char_Array_0[0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=256, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L75] EXPR signed_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=256, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L75] CALL assume_abort_if_not(signed_char_Array_0[0] <= 63) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=256, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=256, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L75] RET assume_abort_if_not(signed_char_Array_0[0] <= 63) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=256, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L76] signed_char_Array_0[2] = __VERIFIER_nondet_char() [L77] EXPR signed_char_Array_0[2] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=256, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L77] CALL assume_abort_if_not(signed_char_Array_0[2] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=256, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=256, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L77] RET assume_abort_if_not(signed_char_Array_0[2] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=256, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L78] EXPR signed_char_Array_0[2] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=256, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L78] CALL assume_abort_if_not(signed_char_Array_0[2] <= 63) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=256, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=256, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L78] RET assume_abort_if_not(signed_char_Array_0[2] <= 63) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=256, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L79] signed_char_Array_0[3] = __VERIFIER_nondet_char() [L80] EXPR signed_char_Array_0[3] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=256, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L80] CALL assume_abort_if_not(signed_char_Array_0[3] >= -1) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=256, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=256, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L80] RET assume_abort_if_not(signed_char_Array_0[3] >= -1) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=256, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L81] EXPR signed_char_Array_0[3] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=256, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L81] CALL assume_abort_if_not(signed_char_Array_0[3] <= 126) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=256, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=256, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L81] RET assume_abort_if_not(signed_char_Array_0[3] <= 126) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=256, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L82] signed_char_Array_0[5] = __VERIFIER_nondet_char() [L83] EXPR signed_char_Array_0[5] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=256, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L83] CALL assume_abort_if_not(signed_char_Array_0[5] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=256, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=256, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L83] RET assume_abort_if_not(signed_char_Array_0[5] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=256, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L84] EXPR signed_char_Array_0[5] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=256, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L84] CALL assume_abort_if_not(signed_char_Array_0[5] <= 31) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=256, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=256, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L84] RET assume_abort_if_not(signed_char_Array_0[5] <= 31) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=256, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L85] signed_char_Array_0[6] = __VERIFIER_nondet_char() [L86] EXPR signed_char_Array_0[6] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=256, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L86] CALL assume_abort_if_not(signed_char_Array_0[6] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=256, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=256, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L86] RET assume_abort_if_not(signed_char_Array_0[6] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=256, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L87] EXPR signed_char_Array_0[6] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=256, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L87] CALL assume_abort_if_not(signed_char_Array_0[6] <= 63) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=256, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=256, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L87] RET assume_abort_if_not(signed_char_Array_0[6] <= 63) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=256, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L88] unsigned_long_int_Array_0[1] = __VERIFIER_nondet_ulong() [L89] EXPR unsigned_long_int_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=256, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L89] CALL assume_abort_if_not(unsigned_long_int_Array_0[1] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=256, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=256, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L89] RET assume_abort_if_not(unsigned_long_int_Array_0[1] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=256, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L90] EXPR unsigned_long_int_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=256, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L90] CALL assume_abort_if_not(unsigned_long_int_Array_0[1] <= 4294967294) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=256, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=256, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L90] RET assume_abort_if_not(unsigned_long_int_Array_0[1] <= 4294967294) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=256, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L104] RET updateVariables() [L105] CALL step() [L44] EXPR unsigned_long_int_Array_0[1] [L44] unsigned_long_int_Array_0[0] = unsigned_long_int_Array_0[1] [L45] signed_short_int_Array_0[0] = last_1_signed_short_int_Array_0_0_ [L46] EXPR signed_char_Array_0[2] [L46] signed_char_Array_0[1] = signed_char_Array_0[2] [L47] EXPR BOOL_unsigned_char_Array_0[1] [L47] BOOL_unsigned_char_Array_0[0] = BOOL_unsigned_char_Array_0[1] [L48] EXPR float_Array_0[1][1] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=256, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L48] EXPR ((1.1f) < (float_Array_0[1][1])) ? (1.1f) : (float_Array_0[1][1]) [L48] EXPR ((1.1f) < (float_Array_0[1][1])) ? (1.1f) : (float_Array_0[1][1]) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=256, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L48] EXPR float_Array_0[0][1] [L48] EXPR float_Array_0[1][0] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=256, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L48] COND FALSE !(((((1.1f) < (float_Array_0[1][1])) ? (1.1f) : (float_Array_0[1][1]))) > (float_Array_0[0][1] * float_Array_0[1][0])) [L51] EXPR signed_char_Array_0[1] [L51] signed char stepLocal_0 = signed_char_Array_0[1]; [L52] EXPR signed_char_Array_0[1] [L52] EXPR signed_short_int_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=256, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L52] EXPR ((signed_char_Array_0[1]) < (signed_short_int_Array_0[0])) ? (signed_char_Array_0[1]) : (signed_short_int_Array_0[0]) [L52] EXPR signed_char_Array_0[1] [L52] EXPR ((signed_char_Array_0[1]) < (signed_short_int_Array_0[0])) ? (signed_char_Array_0[1]) : (signed_short_int_Array_0[0]) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=256, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, stepLocal_0=11, unsigned_long_int_Array_0={9:0}] [L52] COND FALSE !(stepLocal_0 != ((((signed_char_Array_0[1]) < (signed_short_int_Array_0[0])) ? (signed_char_Array_0[1]) : (signed_short_int_Array_0[0])))) [L55] EXPR float_Array_0[1][0] [L55] EXPR float_Array_0[1][1] [L55] EXPR float_Array_0[0][1] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=256, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L55] EXPR ((float_Array_0[1][1]) < (float_Array_0[0][1])) ? (float_Array_0[1][1]) : (float_Array_0[0][1]) [L55] EXPR float_Array_0[1][1] [L55] EXPR ((float_Array_0[1][1]) < (float_Array_0[0][1])) ? (float_Array_0[1][1]) : (float_Array_0[0][1]) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=256, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L55] EXPR float_Array_0[0][0] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=256, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L55] COND TRUE float_Array_0[1][0] <= (((((float_Array_0[1][1]) < (float_Array_0[0][1])) ? (float_Array_0[1][1]) : (float_Array_0[0][1]))) * float_Array_0[0][0]) [L56] EXPR signed_char_Array_0[1] [L56] EXPR signed_char_Array_0[4] [L56] EXPR signed_char_Array_0[4] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=256, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L56] EXPR (((signed_char_Array_0[1] + signed_char_Array_0[4])) > (signed_char_Array_0[4])) ? ((signed_char_Array_0[1] + signed_char_Array_0[4])) : (signed_char_Array_0[4]) [L56] EXPR signed_char_Array_0[1] [L56] EXPR signed_char_Array_0[4] [L56] EXPR (((signed_char_Array_0[1] + signed_char_Array_0[4])) > (signed_char_Array_0[4])) ? ((signed_char_Array_0[1] + signed_char_Array_0[4])) : (signed_char_Array_0[4]) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=256, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L56] EXPR signed_char_Array_0[4] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=256, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L56] EXPR ((signed_char_Array_0[4]) < 0 ) ? -(signed_char_Array_0[4]) : (signed_char_Array_0[4]) [L56] EXPR signed_char_Array_0[4] [L56] EXPR ((signed_char_Array_0[4]) < 0 ) ? -(signed_char_Array_0[4]) : (signed_char_Array_0[4]) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=256, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L56] EXPR (((((((signed_char_Array_0[1] + signed_char_Array_0[4])) > (signed_char_Array_0[4])) ? ((signed_char_Array_0[1] + signed_char_Array_0[4])) : (signed_char_Array_0[4])))) > (((((signed_char_Array_0[4]) < 0 ) ? -(signed_char_Array_0[4]) : (signed_char_Array_0[4]))))) ? ((((((signed_char_Array_0[1] + signed_char_Array_0[4])) > (signed_char_Array_0[4])) ? ((signed_char_Array_0[1] + signed_char_Array_0[4])) : (signed_char_Array_0[4])))) : (((((signed_char_Array_0[4]) < 0 ) ? -(signed_char_Array_0[4]) : (signed_char_Array_0[4])))) [L56] EXPR signed_char_Array_0[4] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=256, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L56] EXPR ((signed_char_Array_0[4]) < 0 ) ? -(signed_char_Array_0[4]) : (signed_char_Array_0[4]) [L56] EXPR signed_char_Array_0[4] [L56] EXPR ((signed_char_Array_0[4]) < 0 ) ? -(signed_char_Array_0[4]) : (signed_char_Array_0[4]) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=256, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L56] EXPR (((((((signed_char_Array_0[1] + signed_char_Array_0[4])) > (signed_char_Array_0[4])) ? ((signed_char_Array_0[1] + signed_char_Array_0[4])) : (signed_char_Array_0[4])))) > (((((signed_char_Array_0[4]) < 0 ) ? -(signed_char_Array_0[4]) : (signed_char_Array_0[4]))))) ? ((((((signed_char_Array_0[1] + signed_char_Array_0[4])) > (signed_char_Array_0[4])) ? ((signed_char_Array_0[1] + signed_char_Array_0[4])) : (signed_char_Array_0[4])))) : (((((signed_char_Array_0[4]) < 0 ) ? -(signed_char_Array_0[4]) : (signed_char_Array_0[4])))) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=256, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L56] signed_long_int_Array_0[0] = (((((((((signed_char_Array_0[1] + signed_char_Array_0[4])) > (signed_char_Array_0[4])) ? ((signed_char_Array_0[1] + signed_char_Array_0[4])) : (signed_char_Array_0[4])))) > (((((signed_char_Array_0[4]) < 0 ) ? -(signed_char_Array_0[4]) : (signed_char_Array_0[4]))))) ? ((((((signed_char_Array_0[1] + signed_char_Array_0[4])) > (signed_char_Array_0[4])) ? ((signed_char_Array_0[1] + signed_char_Array_0[4])) : (signed_char_Array_0[4])))) : (((((signed_char_Array_0[4]) < 0 ) ? -(signed_char_Array_0[4]) : (signed_char_Array_0[4])))))) [L105] RET step() [L106] CALL, EXPR property() [L96] EXPR float_Array_0[1][1] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=256, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L96] EXPR ((1.1f) < (float_Array_0[1][1])) ? (1.1f) : (float_Array_0[1][1]) [L96] EXPR ((1.1f) < (float_Array_0[1][1])) ? (1.1f) : (float_Array_0[1][1]) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=256, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L96] EXPR float_Array_0[0][1] [L96] EXPR float_Array_0[1][0] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=256, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L96] EXPR (((((1.1f) < (float_Array_0[1][1])) ? (1.1f) : (float_Array_0[1][1]))) > (float_Array_0[0][1] * float_Array_0[1][0])) ? (BOOL_unsigned_char_Array_0[2] == ((unsigned char) (BOOL_unsigned_char_Array_0[0] && BOOL_unsigned_char_Array_0[1]))) : 1 [L96] EXPR (((((1.1f) < (float_Array_0[1][1])) ? (1.1f) : (float_Array_0[1][1]))) > (float_Array_0[0][1] * float_Array_0[1][0])) ? (BOOL_unsigned_char_Array_0[2] == ((unsigned char) (BOOL_unsigned_char_Array_0[0] && BOOL_unsigned_char_Array_0[1]))) : 1 VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=256, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L96] EXPR ((((((1.1f) < (float_Array_0[1][1])) ? (1.1f) : (float_Array_0[1][1]))) > (float_Array_0[0][1] * float_Array_0[1][0])) ? (BOOL_unsigned_char_Array_0[2] == ((unsigned char) (BOOL_unsigned_char_Array_0[0] && BOOL_unsigned_char_Array_0[1]))) : 1) && ((float_Array_0[1][0] <= (((((float_Array_0[1][1]) < (float_Array_0[0][1])) ? (float_Array_0[1][1]) : (float_Array_0[0][1]))) * float_Array_0[0][0])) ? (signed_long_int_Array_0[0] == ((signed long int) (((((((((signed_char_Array_0[1] + signed_char_Array_0[4])) > (signed_char_Array_0[4])) ? ((signed_char_Array_0[1] + signed_char_Array_0[4])) : (signed_char_Array_0[4])))) > (((((signed_char_Array_0[4]) < 0 ) ? -(signed_char_Array_0[4]) : (signed_char_Array_0[4]))))) ? ((((((signed_char_Array_0[1] + signed_char_Array_0[4])) > (signed_char_Array_0[4])) ? ((signed_char_Array_0[1] + signed_char_Array_0[4])) : (signed_char_Array_0[4])))) : (((((signed_char_Array_0[4]) < 0 ) ? -(signed_char_Array_0[4]) : (signed_char_Array_0[4])))))))) : (signed_long_int_Array_0[0] == ((signed long int) signed_char_Array_0[1]))) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=256, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L96] EXPR ((((((1.1f) < (float_Array_0[1][1])) ? (1.1f) : (float_Array_0[1][1]))) > (float_Array_0[0][1] * float_Array_0[1][0])) ? (BOOL_unsigned_char_Array_0[2] == ((unsigned char) (BOOL_unsigned_char_Array_0[0] && BOOL_unsigned_char_Array_0[1]))) : 1) && ((float_Array_0[1][0] <= (((((float_Array_0[1][1]) < (float_Array_0[0][1])) ? (float_Array_0[1][1]) : (float_Array_0[0][1]))) * float_Array_0[0][0])) ? (signed_long_int_Array_0[0] == ((signed long int) (((((((((signed_char_Array_0[1] + signed_char_Array_0[4])) > (signed_char_Array_0[4])) ? ((signed_char_Array_0[1] + signed_char_Array_0[4])) : (signed_char_Array_0[4])))) > (((((signed_char_Array_0[4]) < 0 ) ? -(signed_char_Array_0[4]) : (signed_char_Array_0[4]))))) ? ((((((signed_char_Array_0[1] + signed_char_Array_0[4])) > (signed_char_Array_0[4])) ? ((signed_char_Array_0[1] + signed_char_Array_0[4])) : (signed_char_Array_0[4])))) : (((((signed_char_Array_0[4]) < 0 ) ? -(signed_char_Array_0[4]) : (signed_char_Array_0[4])))))))) : (signed_long_int_Array_0[0] == ((signed long int) signed_char_Array_0[1]))) [L96] EXPR float_Array_0[1][0] [L96] EXPR float_Array_0[1][1] [L96] EXPR float_Array_0[0][1] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=256, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L96] EXPR ((float_Array_0[1][1]) < (float_Array_0[0][1])) ? (float_Array_0[1][1]) : (float_Array_0[0][1]) [L96] EXPR float_Array_0[1][1] [L96] EXPR ((float_Array_0[1][1]) < (float_Array_0[0][1])) ? (float_Array_0[1][1]) : (float_Array_0[0][1]) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=256, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L96] EXPR float_Array_0[0][0] VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=256, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L96] EXPR (float_Array_0[1][0] <= (((((float_Array_0[1][1]) < (float_Array_0[0][1])) ? (float_Array_0[1][1]) : (float_Array_0[0][1]))) * float_Array_0[0][0])) ? (signed_long_int_Array_0[0] == ((signed long int) (((((((((signed_char_Array_0[1] + signed_char_Array_0[4])) > (signed_char_Array_0[4])) ? ((signed_char_Array_0[1] + signed_char_Array_0[4])) : (signed_char_Array_0[4])))) > (((((signed_char_Array_0[4]) < 0 ) ? -(signed_char_Array_0[4]) : (signed_char_Array_0[4]))))) ? ((((((signed_char_Array_0[1] + signed_char_Array_0[4])) > (signed_char_Array_0[4])) ? ((signed_char_Array_0[1] + signed_char_Array_0[4])) : (signed_char_Array_0[4])))) : (((((signed_char_Array_0[4]) < 0 ) ? -(signed_char_Array_0[4]) : (signed_char_Array_0[4])))))))) : (signed_long_int_Array_0[0] == ((signed long int) signed_char_Array_0[1])) [L96] EXPR signed_long_int_Array_0[0] [L96] EXPR signed_char_Array_0[1] [L96] EXPR (float_Array_0[1][0] <= (((((float_Array_0[1][1]) < (float_Array_0[0][1])) ? (float_Array_0[1][1]) : (float_Array_0[0][1]))) * float_Array_0[0][0])) ? (signed_long_int_Array_0[0] == ((signed long int) (((((((((signed_char_Array_0[1] + signed_char_Array_0[4])) > (signed_char_Array_0[4])) ? ((signed_char_Array_0[1] + signed_char_Array_0[4])) : (signed_char_Array_0[4])))) > (((((signed_char_Array_0[4]) < 0 ) ? -(signed_char_Array_0[4]) : (signed_char_Array_0[4]))))) ? ((((((signed_char_Array_0[1] + signed_char_Array_0[4])) > (signed_char_Array_0[4])) ? ((signed_char_Array_0[1] + signed_char_Array_0[4])) : (signed_char_Array_0[4])))) : (((((signed_char_Array_0[4]) < 0 ) ? -(signed_char_Array_0[4]) : (signed_char_Array_0[4])))))))) : (signed_long_int_Array_0[0] == ((signed long int) signed_char_Array_0[1])) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=256, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L96] EXPR ((((((1.1f) < (float_Array_0[1][1])) ? (1.1f) : (float_Array_0[1][1]))) > (float_Array_0[0][1] * float_Array_0[1][0])) ? (BOOL_unsigned_char_Array_0[2] == ((unsigned char) (BOOL_unsigned_char_Array_0[0] && BOOL_unsigned_char_Array_0[1]))) : 1) && ((float_Array_0[1][0] <= (((((float_Array_0[1][1]) < (float_Array_0[0][1])) ? (float_Array_0[1][1]) : (float_Array_0[0][1]))) * float_Array_0[0][0])) ? (signed_long_int_Array_0[0] == ((signed long int) (((((((((signed_char_Array_0[1] + signed_char_Array_0[4])) > (signed_char_Array_0[4])) ? ((signed_char_Array_0[1] + signed_char_Array_0[4])) : (signed_char_Array_0[4])))) > (((((signed_char_Array_0[4]) < 0 ) ? -(signed_char_Array_0[4]) : (signed_char_Array_0[4]))))) ? ((((((signed_char_Array_0[1] + signed_char_Array_0[4])) > (signed_char_Array_0[4])) ? ((signed_char_Array_0[1] + signed_char_Array_0[4])) : (signed_char_Array_0[4])))) : (((((signed_char_Array_0[4]) < 0 ) ? -(signed_char_Array_0[4]) : (signed_char_Array_0[4])))))))) : (signed_long_int_Array_0[0] == ((signed long int) signed_char_Array_0[1]))) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=256, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L96] EXPR (((((((1.1f) < (float_Array_0[1][1])) ? (1.1f) : (float_Array_0[1][1]))) > (float_Array_0[0][1] * float_Array_0[1][0])) ? (BOOL_unsigned_char_Array_0[2] == ((unsigned char) (BOOL_unsigned_char_Array_0[0] && BOOL_unsigned_char_Array_0[1]))) : 1) && ((float_Array_0[1][0] <= (((((float_Array_0[1][1]) < (float_Array_0[0][1])) ? (float_Array_0[1][1]) : (float_Array_0[0][1]))) * float_Array_0[0][0])) ? (signed_long_int_Array_0[0] == ((signed long int) (((((((((signed_char_Array_0[1] + signed_char_Array_0[4])) > (signed_char_Array_0[4])) ? ((signed_char_Array_0[1] + signed_char_Array_0[4])) : (signed_char_Array_0[4])))) > (((((signed_char_Array_0[4]) < 0 ) ? -(signed_char_Array_0[4]) : (signed_char_Array_0[4]))))) ? ((((((signed_char_Array_0[1] + signed_char_Array_0[4])) > (signed_char_Array_0[4])) ? ((signed_char_Array_0[1] + signed_char_Array_0[4])) : (signed_char_Array_0[4])))) : (((((signed_char_Array_0[4]) < 0 ) ? -(signed_char_Array_0[4]) : (signed_char_Array_0[4])))))))) : (signed_long_int_Array_0[0] == ((signed long int) signed_char_Array_0[1])))) && (unsigned_long_int_Array_0[0] == ((unsigned long int) unsigned_long_int_Array_0[1])) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=256, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L96] EXPR (((((((1.1f) < (float_Array_0[1][1])) ? (1.1f) : (float_Array_0[1][1]))) > (float_Array_0[0][1] * float_Array_0[1][0])) ? (BOOL_unsigned_char_Array_0[2] == ((unsigned char) (BOOL_unsigned_char_Array_0[0] && BOOL_unsigned_char_Array_0[1]))) : 1) && ((float_Array_0[1][0] <= (((((float_Array_0[1][1]) < (float_Array_0[0][1])) ? (float_Array_0[1][1]) : (float_Array_0[0][1]))) * float_Array_0[0][0])) ? (signed_long_int_Array_0[0] == ((signed long int) (((((((((signed_char_Array_0[1] + signed_char_Array_0[4])) > (signed_char_Array_0[4])) ? ((signed_char_Array_0[1] + signed_char_Array_0[4])) : (signed_char_Array_0[4])))) > (((((signed_char_Array_0[4]) < 0 ) ? -(signed_char_Array_0[4]) : (signed_char_Array_0[4]))))) ? ((((((signed_char_Array_0[1] + signed_char_Array_0[4])) > (signed_char_Array_0[4])) ? ((signed_char_Array_0[1] + signed_char_Array_0[4])) : (signed_char_Array_0[4])))) : (((((signed_char_Array_0[4]) < 0 ) ? -(signed_char_Array_0[4]) : (signed_char_Array_0[4])))))))) : (signed_long_int_Array_0[0] == ((signed long int) signed_char_Array_0[1])))) && (unsigned_long_int_Array_0[0] == ((unsigned long int) unsigned_long_int_Array_0[1])) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=256, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L96] EXPR ((((((((1.1f) < (float_Array_0[1][1])) ? (1.1f) : (float_Array_0[1][1]))) > (float_Array_0[0][1] * float_Array_0[1][0])) ? (BOOL_unsigned_char_Array_0[2] == ((unsigned char) (BOOL_unsigned_char_Array_0[0] && BOOL_unsigned_char_Array_0[1]))) : 1) && ((float_Array_0[1][0] <= (((((float_Array_0[1][1]) < (float_Array_0[0][1])) ? (float_Array_0[1][1]) : (float_Array_0[0][1]))) * float_Array_0[0][0])) ? (signed_long_int_Array_0[0] == ((signed long int) (((((((((signed_char_Array_0[1] + signed_char_Array_0[4])) > (signed_char_Array_0[4])) ? ((signed_char_Array_0[1] + signed_char_Array_0[4])) : (signed_char_Array_0[4])))) > (((((signed_char_Array_0[4]) < 0 ) ? -(signed_char_Array_0[4]) : (signed_char_Array_0[4]))))) ? ((((((signed_char_Array_0[1] + signed_char_Array_0[4])) > (signed_char_Array_0[4])) ? ((signed_char_Array_0[1] + signed_char_Array_0[4])) : (signed_char_Array_0[4])))) : (((((signed_char_Array_0[4]) < 0 ) ? -(signed_char_Array_0[4]) : (signed_char_Array_0[4])))))))) : (signed_long_int_Array_0[0] == ((signed long int) signed_char_Array_0[1])))) && (unsigned_long_int_Array_0[0] == ((unsigned long int) unsigned_long_int_Array_0[1]))) && ((signed_char_Array_0[1] != ((((signed_char_Array_0[1]) < (signed_short_int_Array_0[0])) ? (signed_char_Array_0[1]) : (signed_short_int_Array_0[0])))) ? (signed_char_Array_0[4] == ((signed char) ((((((10 + signed_char_Array_0[2])) < (signed_char_Array_0[3])) ? ((10 + signed_char_Array_0[2])) : (signed_char_Array_0[3]))) - ((32 - signed_char_Array_0[5]) + ((((signed_char_Array_0[6]) > (signed_char_Array_0[0])) ? (signed_char_Array_0[6]) : (signed_char_Array_0[0]))))))) : 1) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=256, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L96] EXPR ((((((((1.1f) < (float_Array_0[1][1])) ? (1.1f) : (float_Array_0[1][1]))) > (float_Array_0[0][1] * float_Array_0[1][0])) ? (BOOL_unsigned_char_Array_0[2] == ((unsigned char) (BOOL_unsigned_char_Array_0[0] && BOOL_unsigned_char_Array_0[1]))) : 1) && ((float_Array_0[1][0] <= (((((float_Array_0[1][1]) < (float_Array_0[0][1])) ? (float_Array_0[1][1]) : (float_Array_0[0][1]))) * float_Array_0[0][0])) ? (signed_long_int_Array_0[0] == ((signed long int) (((((((((signed_char_Array_0[1] + signed_char_Array_0[4])) > (signed_char_Array_0[4])) ? ((signed_char_Array_0[1] + signed_char_Array_0[4])) : (signed_char_Array_0[4])))) > (((((signed_char_Array_0[4]) < 0 ) ? -(signed_char_Array_0[4]) : (signed_char_Array_0[4]))))) ? ((((((signed_char_Array_0[1] + signed_char_Array_0[4])) > (signed_char_Array_0[4])) ? ((signed_char_Array_0[1] + signed_char_Array_0[4])) : (signed_char_Array_0[4])))) : (((((signed_char_Array_0[4]) < 0 ) ? -(signed_char_Array_0[4]) : (signed_char_Array_0[4])))))))) : (signed_long_int_Array_0[0] == ((signed long int) signed_char_Array_0[1])))) && (unsigned_long_int_Array_0[0] == ((unsigned long int) unsigned_long_int_Array_0[1]))) && ((signed_char_Array_0[1] != ((((signed_char_Array_0[1]) < (signed_short_int_Array_0[0])) ? (signed_char_Array_0[1]) : (signed_short_int_Array_0[0])))) ? (signed_char_Array_0[4] == ((signed char) ((((((10 + signed_char_Array_0[2])) < (signed_char_Array_0[3])) ? ((10 + signed_char_Array_0[2])) : (signed_char_Array_0[3]))) - ((32 - signed_char_Array_0[5]) + ((((signed_char_Array_0[6]) > (signed_char_Array_0[0])) ? (signed_char_Array_0[6]) : (signed_char_Array_0[0]))))))) : 1) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=256, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L96] EXPR (((((((((1.1f) < (float_Array_0[1][1])) ? (1.1f) : (float_Array_0[1][1]))) > (float_Array_0[0][1] * float_Array_0[1][0])) ? (BOOL_unsigned_char_Array_0[2] == ((unsigned char) (BOOL_unsigned_char_Array_0[0] && BOOL_unsigned_char_Array_0[1]))) : 1) && ((float_Array_0[1][0] <= (((((float_Array_0[1][1]) < (float_Array_0[0][1])) ? (float_Array_0[1][1]) : (float_Array_0[0][1]))) * float_Array_0[0][0])) ? (signed_long_int_Array_0[0] == ((signed long int) (((((((((signed_char_Array_0[1] + signed_char_Array_0[4])) > (signed_char_Array_0[4])) ? ((signed_char_Array_0[1] + signed_char_Array_0[4])) : (signed_char_Array_0[4])))) > (((((signed_char_Array_0[4]) < 0 ) ? -(signed_char_Array_0[4]) : (signed_char_Array_0[4]))))) ? ((((((signed_char_Array_0[1] + signed_char_Array_0[4])) > (signed_char_Array_0[4])) ? ((signed_char_Array_0[1] + signed_char_Array_0[4])) : (signed_char_Array_0[4])))) : (((((signed_char_Array_0[4]) < 0 ) ? -(signed_char_Array_0[4]) : (signed_char_Array_0[4])))))))) : (signed_long_int_Array_0[0] == ((signed long int) signed_char_Array_0[1])))) && (unsigned_long_int_Array_0[0] == ((unsigned long int) unsigned_long_int_Array_0[1]))) && ((signed_char_Array_0[1] != ((((signed_char_Array_0[1]) < (signed_short_int_Array_0[0])) ? (signed_char_Array_0[1]) : (signed_short_int_Array_0[0])))) ? (signed_char_Array_0[4] == ((signed char) ((((((10 + signed_char_Array_0[2])) < (signed_char_Array_0[3])) ? ((10 + signed_char_Array_0[2])) : (signed_char_Array_0[3]))) - ((32 - signed_char_Array_0[5]) + ((((signed_char_Array_0[6]) > (signed_char_Array_0[0])) ? (signed_char_Array_0[6]) : (signed_char_Array_0[0]))))))) : 1)) && (signed_short_int_Array_0[0] == ((signed short int) last_1_signed_short_int_Array_0_0_)) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=256, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L96] EXPR (((((((((1.1f) < (float_Array_0[1][1])) ? (1.1f) : (float_Array_0[1][1]))) > (float_Array_0[0][1] * float_Array_0[1][0])) ? (BOOL_unsigned_char_Array_0[2] == ((unsigned char) (BOOL_unsigned_char_Array_0[0] && BOOL_unsigned_char_Array_0[1]))) : 1) && ((float_Array_0[1][0] <= (((((float_Array_0[1][1]) < (float_Array_0[0][1])) ? (float_Array_0[1][1]) : (float_Array_0[0][1]))) * float_Array_0[0][0])) ? (signed_long_int_Array_0[0] == ((signed long int) (((((((((signed_char_Array_0[1] + signed_char_Array_0[4])) > (signed_char_Array_0[4])) ? ((signed_char_Array_0[1] + signed_char_Array_0[4])) : (signed_char_Array_0[4])))) > (((((signed_char_Array_0[4]) < 0 ) ? -(signed_char_Array_0[4]) : (signed_char_Array_0[4]))))) ? ((((((signed_char_Array_0[1] + signed_char_Array_0[4])) > (signed_char_Array_0[4])) ? ((signed_char_Array_0[1] + signed_char_Array_0[4])) : (signed_char_Array_0[4])))) : (((((signed_char_Array_0[4]) < 0 ) ? -(signed_char_Array_0[4]) : (signed_char_Array_0[4])))))))) : (signed_long_int_Array_0[0] == ((signed long int) signed_char_Array_0[1])))) && (unsigned_long_int_Array_0[0] == ((unsigned long int) unsigned_long_int_Array_0[1]))) && ((signed_char_Array_0[1] != ((((signed_char_Array_0[1]) < (signed_short_int_Array_0[0])) ? (signed_char_Array_0[1]) : (signed_short_int_Array_0[0])))) ? (signed_char_Array_0[4] == ((signed char) ((((((10 + signed_char_Array_0[2])) < (signed_char_Array_0[3])) ? ((10 + signed_char_Array_0[2])) : (signed_char_Array_0[3]))) - ((32 - signed_char_Array_0[5]) + ((((signed_char_Array_0[6]) > (signed_char_Array_0[0])) ? (signed_char_Array_0[6]) : (signed_char_Array_0[0]))))))) : 1)) && (signed_short_int_Array_0[0] == ((signed short int) last_1_signed_short_int_Array_0_0_)) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=256, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L96] EXPR ((((((((((1.1f) < (float_Array_0[1][1])) ? (1.1f) : (float_Array_0[1][1]))) > (float_Array_0[0][1] * float_Array_0[1][0])) ? (BOOL_unsigned_char_Array_0[2] == ((unsigned char) (BOOL_unsigned_char_Array_0[0] && BOOL_unsigned_char_Array_0[1]))) : 1) && ((float_Array_0[1][0] <= (((((float_Array_0[1][1]) < (float_Array_0[0][1])) ? (float_Array_0[1][1]) : (float_Array_0[0][1]))) * float_Array_0[0][0])) ? (signed_long_int_Array_0[0] == ((signed long int) (((((((((signed_char_Array_0[1] + signed_char_Array_0[4])) > (signed_char_Array_0[4])) ? ((signed_char_Array_0[1] + signed_char_Array_0[4])) : (signed_char_Array_0[4])))) > (((((signed_char_Array_0[4]) < 0 ) ? -(signed_char_Array_0[4]) : (signed_char_Array_0[4]))))) ? ((((((signed_char_Array_0[1] + signed_char_Array_0[4])) > (signed_char_Array_0[4])) ? ((signed_char_Array_0[1] + signed_char_Array_0[4])) : (signed_char_Array_0[4])))) : (((((signed_char_Array_0[4]) < 0 ) ? -(signed_char_Array_0[4]) : (signed_char_Array_0[4])))))))) : (signed_long_int_Array_0[0] == ((signed long int) signed_char_Array_0[1])))) && (unsigned_long_int_Array_0[0] == ((unsigned long int) unsigned_long_int_Array_0[1]))) && ((signed_char_Array_0[1] != ((((signed_char_Array_0[1]) < (signed_short_int_Array_0[0])) ? (signed_char_Array_0[1]) : (signed_short_int_Array_0[0])))) ? (signed_char_Array_0[4] == ((signed char) ((((((10 + signed_char_Array_0[2])) < (signed_char_Array_0[3])) ? ((10 + signed_char_Array_0[2])) : (signed_char_Array_0[3]))) - ((32 - signed_char_Array_0[5]) + ((((signed_char_Array_0[6]) > (signed_char_Array_0[0])) ? (signed_char_Array_0[6]) : (signed_char_Array_0[0]))))))) : 1)) && (signed_short_int_Array_0[0] == ((signed short int) last_1_signed_short_int_Array_0_0_))) && (signed_char_Array_0[1] == ((signed char) signed_char_Array_0[2])) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=256, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L96] EXPR ((((((((((1.1f) < (float_Array_0[1][1])) ? (1.1f) : (float_Array_0[1][1]))) > (float_Array_0[0][1] * float_Array_0[1][0])) ? (BOOL_unsigned_char_Array_0[2] == ((unsigned char) (BOOL_unsigned_char_Array_0[0] && BOOL_unsigned_char_Array_0[1]))) : 1) && ((float_Array_0[1][0] <= (((((float_Array_0[1][1]) < (float_Array_0[0][1])) ? (float_Array_0[1][1]) : (float_Array_0[0][1]))) * float_Array_0[0][0])) ? (signed_long_int_Array_0[0] == ((signed long int) (((((((((signed_char_Array_0[1] + signed_char_Array_0[4])) > (signed_char_Array_0[4])) ? ((signed_char_Array_0[1] + signed_char_Array_0[4])) : (signed_char_Array_0[4])))) > (((((signed_char_Array_0[4]) < 0 ) ? -(signed_char_Array_0[4]) : (signed_char_Array_0[4]))))) ? ((((((signed_char_Array_0[1] + signed_char_Array_0[4])) > (signed_char_Array_0[4])) ? ((signed_char_Array_0[1] + signed_char_Array_0[4])) : (signed_char_Array_0[4])))) : (((((signed_char_Array_0[4]) < 0 ) ? -(signed_char_Array_0[4]) : (signed_char_Array_0[4])))))))) : (signed_long_int_Array_0[0] == ((signed long int) signed_char_Array_0[1])))) && (unsigned_long_int_Array_0[0] == ((unsigned long int) unsigned_long_int_Array_0[1]))) && ((signed_char_Array_0[1] != ((((signed_char_Array_0[1]) < (signed_short_int_Array_0[0])) ? (signed_char_Array_0[1]) : (signed_short_int_Array_0[0])))) ? (signed_char_Array_0[4] == ((signed char) ((((((10 + signed_char_Array_0[2])) < (signed_char_Array_0[3])) ? ((10 + signed_char_Array_0[2])) : (signed_char_Array_0[3]))) - ((32 - signed_char_Array_0[5]) + ((((signed_char_Array_0[6]) > (signed_char_Array_0[0])) ? (signed_char_Array_0[6]) : (signed_char_Array_0[0]))))))) : 1)) && (signed_short_int_Array_0[0] == ((signed short int) last_1_signed_short_int_Array_0_0_))) && (signed_char_Array_0[1] == ((signed char) signed_char_Array_0[2])) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=256, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L96] EXPR (((((((((((1.1f) < (float_Array_0[1][1])) ? (1.1f) : (float_Array_0[1][1]))) > (float_Array_0[0][1] * float_Array_0[1][0])) ? (BOOL_unsigned_char_Array_0[2] == ((unsigned char) (BOOL_unsigned_char_Array_0[0] && BOOL_unsigned_char_Array_0[1]))) : 1) && ((float_Array_0[1][0] <= (((((float_Array_0[1][1]) < (float_Array_0[0][1])) ? (float_Array_0[1][1]) : (float_Array_0[0][1]))) * float_Array_0[0][0])) ? (signed_long_int_Array_0[0] == ((signed long int) (((((((((signed_char_Array_0[1] + signed_char_Array_0[4])) > (signed_char_Array_0[4])) ? ((signed_char_Array_0[1] + signed_char_Array_0[4])) : (signed_char_Array_0[4])))) > (((((signed_char_Array_0[4]) < 0 ) ? -(signed_char_Array_0[4]) : (signed_char_Array_0[4]))))) ? ((((((signed_char_Array_0[1] + signed_char_Array_0[4])) > (signed_char_Array_0[4])) ? ((signed_char_Array_0[1] + signed_char_Array_0[4])) : (signed_char_Array_0[4])))) : (((((signed_char_Array_0[4]) < 0 ) ? -(signed_char_Array_0[4]) : (signed_char_Array_0[4])))))))) : (signed_long_int_Array_0[0] == ((signed long int) signed_char_Array_0[1])))) && (unsigned_long_int_Array_0[0] == ((unsigned long int) unsigned_long_int_Array_0[1]))) && ((signed_char_Array_0[1] != ((((signed_char_Array_0[1]) < (signed_short_int_Array_0[0])) ? (signed_char_Array_0[1]) : (signed_short_int_Array_0[0])))) ? (signed_char_Array_0[4] == ((signed char) ((((((10 + signed_char_Array_0[2])) < (signed_char_Array_0[3])) ? ((10 + signed_char_Array_0[2])) : (signed_char_Array_0[3]))) - ((32 - signed_char_Array_0[5]) + ((((signed_char_Array_0[6]) > (signed_char_Array_0[0])) ? (signed_char_Array_0[6]) : (signed_char_Array_0[0]))))))) : 1)) && (signed_short_int_Array_0[0] == ((signed short int) last_1_signed_short_int_Array_0_0_))) && (signed_char_Array_0[1] == ((signed char) signed_char_Array_0[2]))) && (BOOL_unsigned_char_Array_0[0] == ((unsigned char) BOOL_unsigned_char_Array_0[1])) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=256, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L96] EXPR (((((((((((1.1f) < (float_Array_0[1][1])) ? (1.1f) : (float_Array_0[1][1]))) > (float_Array_0[0][1] * float_Array_0[1][0])) ? (BOOL_unsigned_char_Array_0[2] == ((unsigned char) (BOOL_unsigned_char_Array_0[0] && BOOL_unsigned_char_Array_0[1]))) : 1) && ((float_Array_0[1][0] <= (((((float_Array_0[1][1]) < (float_Array_0[0][1])) ? (float_Array_0[1][1]) : (float_Array_0[0][1]))) * float_Array_0[0][0])) ? (signed_long_int_Array_0[0] == ((signed long int) (((((((((signed_char_Array_0[1] + signed_char_Array_0[4])) > (signed_char_Array_0[4])) ? ((signed_char_Array_0[1] + signed_char_Array_0[4])) : (signed_char_Array_0[4])))) > (((((signed_char_Array_0[4]) < 0 ) ? -(signed_char_Array_0[4]) : (signed_char_Array_0[4]))))) ? ((((((signed_char_Array_0[1] + signed_char_Array_0[4])) > (signed_char_Array_0[4])) ? ((signed_char_Array_0[1] + signed_char_Array_0[4])) : (signed_char_Array_0[4])))) : (((((signed_char_Array_0[4]) < 0 ) ? -(signed_char_Array_0[4]) : (signed_char_Array_0[4])))))))) : (signed_long_int_Array_0[0] == ((signed long int) signed_char_Array_0[1])))) && (unsigned_long_int_Array_0[0] == ((unsigned long int) unsigned_long_int_Array_0[1]))) && ((signed_char_Array_0[1] != ((((signed_char_Array_0[1]) < (signed_short_int_Array_0[0])) ? (signed_char_Array_0[1]) : (signed_short_int_Array_0[0])))) ? (signed_char_Array_0[4] == ((signed char) ((((((10 + signed_char_Array_0[2])) < (signed_char_Array_0[3])) ? ((10 + signed_char_Array_0[2])) : (signed_char_Array_0[3]))) - ((32 - signed_char_Array_0[5]) + ((((signed_char_Array_0[6]) > (signed_char_Array_0[0])) ? (signed_char_Array_0[6]) : (signed_char_Array_0[0]))))))) : 1)) && (signed_short_int_Array_0[0] == ((signed short int) last_1_signed_short_int_Array_0_0_))) && (signed_char_Array_0[1] == ((signed char) signed_char_Array_0[2]))) && (BOOL_unsigned_char_Array_0[0] == ((unsigned char) BOOL_unsigned_char_Array_0[1])) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=256, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L96-L97] return (((((((((((1.1f) < (float_Array_0[1][1])) ? (1.1f) : (float_Array_0[1][1]))) > (float_Array_0[0][1] * float_Array_0[1][0])) ? (BOOL_unsigned_char_Array_0[2] == ((unsigned char) (BOOL_unsigned_char_Array_0[0] && BOOL_unsigned_char_Array_0[1]))) : 1) && ((float_Array_0[1][0] <= (((((float_Array_0[1][1]) < (float_Array_0[0][1])) ? (float_Array_0[1][1]) : (float_Array_0[0][1]))) * float_Array_0[0][0])) ? (signed_long_int_Array_0[0] == ((signed long int) (((((((((signed_char_Array_0[1] + signed_char_Array_0[4])) > (signed_char_Array_0[4])) ? ((signed_char_Array_0[1] + signed_char_Array_0[4])) : (signed_char_Array_0[4])))) > (((((signed_char_Array_0[4]) < 0 ) ? -(signed_char_Array_0[4]) : (signed_char_Array_0[4]))))) ? ((((((signed_char_Array_0[1] + signed_char_Array_0[4])) > (signed_char_Array_0[4])) ? ((signed_char_Array_0[1] + signed_char_Array_0[4])) : (signed_char_Array_0[4])))) : (((((signed_char_Array_0[4]) < 0 ) ? -(signed_char_Array_0[4]) : (signed_char_Array_0[4])))))))) : (signed_long_int_Array_0[0] == ((signed long int) signed_char_Array_0[1])))) && (unsigned_long_int_Array_0[0] == ((unsigned long int) unsigned_long_int_Array_0[1]))) && ((signed_char_Array_0[1] != ((((signed_char_Array_0[1]) < (signed_short_int_Array_0[0])) ? (signed_char_Array_0[1]) : (signed_short_int_Array_0[0])))) ? (signed_char_Array_0[4] == ((signed char) ((((((10 + signed_char_Array_0[2])) < (signed_char_Array_0[3])) ? ((10 + signed_char_Array_0[2])) : (signed_char_Array_0[3]))) - ((32 - signed_char_Array_0[5]) + ((((signed_char_Array_0[6]) > (signed_char_Array_0[0])) ? (signed_char_Array_0[6]) : (signed_char_Array_0[0]))))))) : 1)) && (signed_short_int_Array_0[0] == ((signed short int) last_1_signed_short_int_Array_0_0_))) && (signed_char_Array_0[1] == ((signed char) signed_char_Array_0[2]))) && (BOOL_unsigned_char_Array_0[0] == ((unsigned char) BOOL_unsigned_char_Array_0[1])) ; [L106] RET, EXPR property() [L106] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=256, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] [L19] reach_error() VAL [BOOL_unsigned_char_Array_0={4:0}, float_Array_0={5:0}, isInitial=1, last_1_signed_short_int_Array_0_0_=256, signed_char_Array_0={6:0}, signed_long_int_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_long_int_Array_0={9:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 138 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 12.2s, OverallIterations: 17, TraceHistogramMax: 18, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1739 SdHoareTripleChecker+Valid, 0.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1735 mSDsluCounter, 12691 SdHoareTripleChecker+Invalid, 0.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 9324 mSDsCounter, 74 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1229 IncrementalHoareTripleChecker+Invalid, 1303 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 74 mSolverCounterUnsat, 3367 mSDtfsCounter, 1229 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1556 GetRequests, 1442 SyntacticMatches, 2 SemanticMatches, 112 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 93 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=557occurred in iteration=16, InterpolantAutomatonStates: 97, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 16 MinimizatonAttempts, 387 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.5s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 5.4s InterpolantComputationTime, 3968 NumberOfCodeBlocks, 3968 NumberOfCodeBlocksAsserted, 25 NumberOfCheckSat, 3934 ConstructedInterpolants, 0 QuantifiedInterpolants, 10762 SizeOfPredicates, 1 NumberOfNonLiveVariables, 4475 ConjunctsInSsa, 37 ConjunctsInUnsatCore, 25 InterpolantComputations, 15 PerfectInterpolantSequences, 14816/15300 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-02-06 03:18:52,515 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, 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-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-63.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash f973c2bd61febfd05a080e69391fa31f4feb1b698b8895a930b455f19afe4cba --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 03:18:54,633 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 03:18:54,711 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-02-06 03:18:54,718 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 03:18:54,718 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 03:18:54,760 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 03:18:54,761 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 03:18:54,761 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 03:18:54,762 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 03:18:54,762 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 03:18:54,762 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 03:18:54,762 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 03:18:54,762 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 03:18:54,762 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 03:18:54,762 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 03:18:54,762 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 03:18:54,762 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-06 03:18:54,762 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 03:18:54,762 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 03:18:54,762 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 03:18:54,762 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-06 03:18:54,762 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 03:18:54,763 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-06 03:18:54,763 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-02-06 03:18:54,763 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-02-06 03:18:54,763 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-02-06 03:18:54,763 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 03:18:54,763 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-06 03:18:54,763 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 03:18:54,763 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 03:18:54,763 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 03:18:54,763 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 03:18:54,763 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 03:18:54,763 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 03:18:54,763 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 03:18:54,763 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 03:18:54,763 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 03:18:54,763 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-06 03:18:54,763 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-06 03:18:54,763 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-02-06 03:18:54,763 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-02-06 03:18:54,764 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 03:18:54,764 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 03:18:54,764 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 03:18:54,764 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 03:18:54,764 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> f973c2bd61febfd05a080e69391fa31f4feb1b698b8895a930b455f19afe4cba [2025-02-06 03:18:55,010 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 03:18:55,024 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 03:18:55,025 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 03:18:55,030 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 03:18:55,032 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 03:18:55,033 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-63.i [2025-02-06 03:18:56,215 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/6a91de066/2ce61946d391400aad1127656497fe29/FLAG8248281da [2025-02-06 03:18:56,454 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 03:18:56,455 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-63.i [2025-02-06 03:18:56,462 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/6a91de066/2ce61946d391400aad1127656497fe29/FLAG8248281da [2025-02-06 03:18:56,775 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/6a91de066/2ce61946d391400aad1127656497fe29 [2025-02-06 03:18:56,779 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 03:18:56,780 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 03:18:56,781 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 03:18:56,781 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 03:18:56,784 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 03:18:56,785 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 03:18:56" (1/1) ... [2025-02-06 03:18:56,786 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1a03345c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:18:56, skipping insertion in model container [2025-02-06 03:18:56,787 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 03:18:56" (1/1) ... [2025-02-06 03:18:56,801 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 03:18:56,898 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-63.i[916,929] [2025-02-06 03:18:56,958 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 03:18:56,969 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 03:18:56,978 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-63.i[916,929] [2025-02-06 03:18:57,019 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 03:18:57,032 INFO L204 MainTranslator]: Completed translation [2025-02-06 03:18:57,032 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:18:57 WrapperNode [2025-02-06 03:18:57,032 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 03:18:57,033 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 03:18:57,033 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 03:18:57,033 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 03:18:57,037 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:18:57" (1/1) ... [2025-02-06 03:18:57,047 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:18:57" (1/1) ... [2025-02-06 03:18:57,075 INFO L138 Inliner]: procedures = 36, calls = 209, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 661 [2025-02-06 03:18:57,075 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 03:18:57,075 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 03:18:57,075 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 03:18:57,075 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 03:18:57,080 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:18:57" (1/1) ... [2025-02-06 03:18:57,081 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:18:57" (1/1) ... [2025-02-06 03:18:57,086 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:18:57" (1/1) ... [2025-02-06 03:18:57,098 INFO L175 MemorySlicer]: Split 174 memory accesses to 7 slices as follows [2, 16, 44, 90, 5, 8, 9]. 52 percent of accesses are in the largest equivalence class. The 20 initializations are split as follows [2, 3, 4, 7, 1, 1, 2]. The 19 writes are split as follows [0, 3, 4, 7, 2, 1, 2]. [2025-02-06 03:18:57,098 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:18:57" (1/1) ... [2025-02-06 03:18:57,098 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:18:57" (1/1) ... [2025-02-06 03:18:57,134 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:18:57" (1/1) ... [2025-02-06 03:18:57,135 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:18:57" (1/1) ... [2025-02-06 03:18:57,140 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:18:57" (1/1) ... [2025-02-06 03:18:57,141 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:18:57" (1/1) ... [2025-02-06 03:18:57,145 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 03:18:57,146 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 03:18:57,146 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 03:18:57,146 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 03:18:57,146 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:18:57" (1/1) ... [2025-02-06 03:18:57,150 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 03:18:57,161 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 03:18:57,170 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-06 03:18:57,178 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-06 03:18:57,194 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 03:18:57,194 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2025-02-06 03:18:57,194 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2025-02-06 03:18:57,194 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2025-02-06 03:18:57,194 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#3 [2025-02-06 03:18:57,194 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#4 [2025-02-06 03:18:57,194 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#5 [2025-02-06 03:18:57,195 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#6 [2025-02-06 03:18:57,195 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#0 [2025-02-06 03:18:57,195 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#1 [2025-02-06 03:18:57,195 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#2 [2025-02-06 03:18:57,195 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#3 [2025-02-06 03:18:57,195 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#4 [2025-02-06 03:18:57,195 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#5 [2025-02-06 03:18:57,195 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#6 [2025-02-06 03:18:57,195 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-02-06 03:18:57,195 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2025-02-06 03:18:57,195 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2025-02-06 03:18:57,195 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#3 [2025-02-06 03:18:57,195 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#4 [2025-02-06 03:18:57,195 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#5 [2025-02-06 03:18:57,195 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#6 [2025-02-06 03:18:57,195 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#0 [2025-02-06 03:18:57,195 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#1 [2025-02-06 03:18:57,195 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#2 [2025-02-06 03:18:57,195 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#3 [2025-02-06 03:18:57,195 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#4 [2025-02-06 03:18:57,195 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#5 [2025-02-06 03:18:57,195 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#6 [2025-02-06 03:18:57,195 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#0 [2025-02-06 03:18:57,195 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#1 [2025-02-06 03:18:57,195 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#2 [2025-02-06 03:18:57,195 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#3 [2025-02-06 03:18:57,195 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#4 [2025-02-06 03:18:57,195 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#5 [2025-02-06 03:18:57,196 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#6 [2025-02-06 03:18:57,196 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2025-02-06 03:18:57,196 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2025-02-06 03:18:57,196 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2025-02-06 03:18:57,196 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#3 [2025-02-06 03:18:57,196 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#4 [2025-02-06 03:18:57,196 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#5 [2025-02-06 03:18:57,196 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#6 [2025-02-06 03:18:57,196 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#0 [2025-02-06 03:18:57,196 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#1 [2025-02-06 03:18:57,196 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#2 [2025-02-06 03:18:57,196 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#3 [2025-02-06 03:18:57,196 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#4 [2025-02-06 03:18:57,196 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#5 [2025-02-06 03:18:57,196 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#6 [2025-02-06 03:18:57,196 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#0 [2025-02-06 03:18:57,196 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#1 [2025-02-06 03:18:57,196 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#2 [2025-02-06 03:18:57,196 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#3 [2025-02-06 03:18:57,196 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#4 [2025-02-06 03:18:57,196 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#5 [2025-02-06 03:18:57,196 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#6 [2025-02-06 03:18:57,196 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#0 [2025-02-06 03:18:57,196 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#1 [2025-02-06 03:18:57,196 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#2 [2025-02-06 03:18:57,196 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#3 [2025-02-06 03:18:57,196 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#4 [2025-02-06 03:18:57,196 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#5 [2025-02-06 03:18:57,196 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#6 [2025-02-06 03:18:57,196 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-06 03:18:57,196 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-06 03:18:57,197 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 03:18:57,197 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 03:18:57,197 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2025-02-06 03:18:57,197 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2025-02-06 03:18:57,197 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#2 [2025-02-06 03:18:57,197 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#3 [2025-02-06 03:18:57,197 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#4 [2025-02-06 03:18:57,197 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#5 [2025-02-06 03:18:57,197 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#6 [2025-02-06 03:18:57,197 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#0 [2025-02-06 03:18:57,197 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#1 [2025-02-06 03:18:57,197 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#2 [2025-02-06 03:18:57,197 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#3 [2025-02-06 03:18:57,197 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#4 [2025-02-06 03:18:57,197 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#5 [2025-02-06 03:18:57,197 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#6 [2025-02-06 03:18:57,197 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2025-02-06 03:18:57,197 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2025-02-06 03:18:57,197 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2025-02-06 03:18:57,197 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#3 [2025-02-06 03:18:57,197 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#4 [2025-02-06 03:18:57,197 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#5 [2025-02-06 03:18:57,197 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#6 [2025-02-06 03:18:57,365 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 03:18:57,367 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 03:18:58,932 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L96: havoc property_#t~mem117#1;havoc property_#t~ite119#1;havoc property_#t~mem118#1;havoc property_#t~mem120#1;havoc property_#t~mem121#1;havoc property_#t~ite126#1;havoc property_#t~mem125#1;havoc property_#t~mem122#1;havoc property_#t~mem123#1;havoc property_#t~short124#1;havoc property_#t~mem133#1;havoc property_#t~mem127#1;havoc property_#t~mem128#1;havoc property_#t~ite131#1;havoc property_#t~mem129#1;havoc property_#t~mem130#1;havoc property_#t~mem132#1;havoc property_#t~ite160#1;havoc property_#t~mem157#1;havoc property_#t~mem134#1;havoc property_#t~mem135#1;havoc property_#t~mem136#1;havoc property_#t~ite140#1;havoc property_#t~mem137#1;havoc property_#t~mem138#1;havoc property_#t~mem139#1;havoc property_#t~mem141#1;havoc property_#t~ite144#1;havoc property_#t~mem142#1;havoc property_#t~mem143#1;havoc property_#t~ite156#1;havoc property_#t~mem145#1;havoc property_#t~mem146#1;havoc property_#t~mem147#1;havoc property_#t~ite151#1;havoc property_#t~mem148#1;havoc property_#t~mem149#1;havoc property_#t~mem150#1;havoc property_#t~mem152#1;havoc property_#t~ite155#1;havoc property_#t~mem153#1;havoc property_#t~mem154#1;havoc property_#t~mem159#1;havoc property_#t~mem158#1;havoc property_#t~short161#1;havoc property_#t~mem163#1;havoc property_#t~mem162#1;havoc property_#t~short164#1;havoc property_#t~mem170#1;havoc property_#t~mem165#1;havoc property_#t~mem166#1;havoc property_#t~ite169#1;havoc property_#t~mem167#1;havoc property_#t~mem168#1;havoc property_#t~ite183#1;havoc property_#t~mem182#1;havoc property_#t~mem171#1;havoc property_#t~mem172#1;havoc property_#t~ite175#1;havoc property_#t~mem173#1;havoc property_#t~mem174#1;havoc property_#t~mem176#1;havoc property_#t~mem177#1;havoc property_#t~mem178#1;havoc property_#t~ite181#1;havoc property_#t~mem179#1;havoc property_#t~mem180#1;havoc property_#t~short184#1;havoc property_#t~mem185#1;havoc property_#t~short186#1;havoc property_#t~mem188#1;havoc property_#t~mem187#1;havoc property_#t~short189#1;havoc property_#t~mem191#1;havoc property_#t~mem190#1;havoc property_#t~short192#1; [2025-02-06 03:18:58,962 INFO L? ?]: Removed 203 outVars from TransFormulas that were not future-live. [2025-02-06 03:18:58,962 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 03:18:58,969 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 03:18:58,969 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 03:18:58,970 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 03:18:58 BoogieIcfgContainer [2025-02-06 03:18:58,970 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 03:18:58,971 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 03:18:58,971 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 03:18:58,974 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 03:18:58,974 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 03:18:56" (1/3) ... [2025-02-06 03:18:58,975 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4756016d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 03:18:58, skipping insertion in model container [2025-02-06 03:18:58,975 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 03:18:57" (2/3) ... [2025-02-06 03:18:58,975 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4756016d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 03:18:58, skipping insertion in model container [2025-02-06 03:18:58,975 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 03:18:58" (3/3) ... [2025-02-06 03:18:58,975 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-a_file-63.i [2025-02-06 03:18:58,984 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 03:18:58,985 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-a_file-63.i that has 2 procedures, 138 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-06 03:18:59,015 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 03:18:59,025 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;@47c4c029, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 03:18:59,025 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-06 03:18:59,029 INFO L276 IsEmpty]: Start isEmpty. Operand has 138 states, 117 states have (on average 1.4273504273504274) internal successors, (167), 118 states have internal predecessors, (167), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-02-06 03:18:59,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2025-02-06 03:18:59,039 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:18:59,039 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-06 03:18:59,040 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:18:59,043 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:18:59,043 INFO L85 PathProgramCache]: Analyzing trace with hash -961652529, now seen corresponding path program 1 times [2025-02-06 03:18:59,051 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 03:18:59,054 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1468935162] [2025-02-06 03:18:59,054 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:18:59,054 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-02-06 03:18:59,055 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 03:18:59,058 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/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-02-06 03:18:59,059 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/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-02-06 03:18:59,227 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 156 statements into 1 equivalence classes. [2025-02-06 03:18:59,471 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 156 of 156 statements. [2025-02-06 03:18:59,471 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:18:59,471 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:18:59,491 INFO L256 TraceCheckSpWp]: Trace formula consists of 342 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-02-06 03:18:59,497 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:18:59,522 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 298 proven. 0 refuted. 0 times theorem prover too weak. 314 trivial. 0 not checked. [2025-02-06 03:18:59,522 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 03:18:59,522 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 03:18:59,522 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1468935162] [2025-02-06 03:18:59,523 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1468935162] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:18:59,523 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:18:59,523 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 03:18:59,524 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [611428931] [2025-02-06 03:18:59,524 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:18:59,526 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-06 03:18:59,526 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 03:18:59,537 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-06 03:18:59,537 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-06 03:18:59,539 INFO L87 Difference]: Start difference. First operand has 138 states, 117 states have (on average 1.4273504273504274) internal successors, (167), 118 states have internal predecessors, (167), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) Second operand has 2 states, 2 states have (on average 36.5) internal successors, (73), 2 states have internal predecessors, (73), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-02-06 03:18:59,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:18:59,557 INFO L93 Difference]: Finished difference Result 270 states and 419 transitions. [2025-02-06 03:18:59,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-06 03:18:59,558 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 36.5) internal successors, (73), 2 states have internal predecessors, (73), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 156 [2025-02-06 03:18:59,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:18:59,562 INFO L225 Difference]: With dead ends: 270 [2025-02-06 03:18:59,562 INFO L226 Difference]: Without dead ends: 135 [2025-02-06 03:18:59,564 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 155 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-02-06 03:18:59,566 INFO L435 NwaCegarLoop]: 198 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, 198 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-02-06 03:18:59,566 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 198 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 03:18:59,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2025-02-06 03:18:59,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 135. [2025-02-06 03:18:59,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 115 states have (on average 1.4086956521739131) internal successors, (162), 115 states have internal predecessors, (162), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-02-06 03:18:59,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 198 transitions. [2025-02-06 03:18:59,591 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 198 transitions. Word has length 156 [2025-02-06 03:18:59,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:18:59,591 INFO L471 AbstractCegarLoop]: Abstraction has 135 states and 198 transitions. [2025-02-06 03:18:59,591 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 36.5) internal successors, (73), 2 states have internal predecessors, (73), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-02-06 03:18:59,591 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 198 transitions. [2025-02-06 03:18:59,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2025-02-06 03:18:59,593 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:18:59,593 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-06 03:18:59,605 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/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)] Forceful destruction successful, exit code 0 [2025-02-06 03:18:59,798 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/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-02-06 03:18:59,798 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:18:59,799 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:18:59,799 INFO L85 PathProgramCache]: Analyzing trace with hash 441779805, now seen corresponding path program 1 times [2025-02-06 03:18:59,799 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 03:18:59,800 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [199727161] [2025-02-06 03:18:59,800 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:18:59,800 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-02-06 03:18:59,800 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 03:18:59,802 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/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-02-06 03:18:59,803 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/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-02-06 03:18:59,933 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 156 statements into 1 equivalence classes. [2025-02-06 03:19:00,183 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 156 of 156 statements. [2025-02-06 03:19:00,183 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:19:00,183 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:19:00,197 INFO L256 TraceCheckSpWp]: Trace formula consists of 342 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-02-06 03:19:00,202 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:19:00,868 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 58 treesize of output 22 [2025-02-06 03:19:00,910 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 260 proven. 0 refuted. 0 times theorem prover too weak. 352 trivial. 0 not checked. [2025-02-06 03:19:00,910 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 03:19:00,910 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 03:19:00,910 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [199727161] [2025-02-06 03:19:00,910 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [199727161] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:19:00,910 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:19:00,910 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 03:19:00,910 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [86359728] [2025-02-06 03:19:00,910 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:19:00,911 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-06 03:19:00,911 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 03:19:00,913 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-06 03:19:00,914 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-02-06 03:19:00,914 INFO L87 Difference]: Start difference. First operand 135 states and 198 transitions. Second operand has 7 states, 7 states have (on average 10.285714285714286) internal successors, (72), 6 states have internal predecessors, (72), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-02-06 03:19:04,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:19:04,521 INFO L93 Difference]: Finished difference Result 396 states and 583 transitions. [2025-02-06 03:19:04,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-06 03:19:04,521 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.285714285714286) internal successors, (72), 6 states have internal predecessors, (72), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 156 [2025-02-06 03:19:04,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:19:04,523 INFO L225 Difference]: With dead ends: 396 [2025-02-06 03:19:04,523 INFO L226 Difference]: Without dead ends: 264 [2025-02-06 03:19:04,524 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 150 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2025-02-06 03:19:04,524 INFO L435 NwaCegarLoop]: 186 mSDtfsCounter, 307 mSDsluCounter, 532 mSDsCounter, 0 mSdLazyCounter, 448 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 307 SdHoareTripleChecker+Valid, 718 SdHoareTripleChecker+Invalid, 452 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 448 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.5s IncrementalHoareTripleChecker+Time [2025-02-06 03:19:04,525 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [307 Valid, 718 Invalid, 452 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 448 Invalid, 0 Unknown, 0 Unchecked, 3.5s Time] [2025-02-06 03:19:04,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 264 states. [2025-02-06 03:19:04,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 264 to 261. [2025-02-06 03:19:04,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 261 states, 222 states have (on average 1.40990990990991) internal successors, (313), 223 states have internal predecessors, (313), 36 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (36), 35 states have call predecessors, (36), 36 states have call successors, (36) [2025-02-06 03:19:04,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 261 states and 385 transitions. [2025-02-06 03:19:04,544 INFO L78 Accepts]: Start accepts. Automaton has 261 states and 385 transitions. Word has length 156 [2025-02-06 03:19:04,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:19:04,545 INFO L471 AbstractCegarLoop]: Abstraction has 261 states and 385 transitions. [2025-02-06 03:19:04,545 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.285714285714286) internal successors, (72), 6 states have internal predecessors, (72), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-02-06 03:19:04,545 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 385 transitions. [2025-02-06 03:19:04,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2025-02-06 03:19:04,547 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:19:04,547 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-06 03:19:04,560 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/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-02-06 03:19:04,747 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-jdk21/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-02-06 03:19:04,747 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:19:04,748 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:19:04,748 INFO L85 PathProgramCache]: Analyzing trace with hash 453095932, now seen corresponding path program 1 times [2025-02-06 03:19:04,748 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 03:19:04,748 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1330849845] [2025-02-06 03:19:04,748 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:19:04,748 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-02-06 03:19:04,749 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 03:19:04,750 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/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-02-06 03:19:04,753 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/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-02-06 03:19:04,855 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 156 statements into 1 equivalence classes. [2025-02-06 03:19:05,109 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 156 of 156 statements. [2025-02-06 03:19:05,109 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:19:05,109 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:19:05,124 INFO L256 TraceCheckSpWp]: Trace formula consists of 343 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-02-06 03:19:05,128 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:19:05,747 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 58 treesize of output 22 [2025-02-06 03:19:05,778 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 260 proven. 0 refuted. 0 times theorem prover too weak. 352 trivial. 0 not checked. [2025-02-06 03:19:05,778 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 03:19:05,778 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 03:19:05,778 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1330849845] [2025-02-06 03:19:05,778 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1330849845] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:19:05,778 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:19:05,778 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 03:19:05,778 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [488319576] [2025-02-06 03:19:05,778 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:19:05,779 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-06 03:19:05,779 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 03:19:05,779 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-06 03:19:05,779 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-02-06 03:19:05,779 INFO L87 Difference]: Start difference. First operand 261 states and 385 transitions. Second operand has 7 states, 7 states have (on average 10.285714285714286) internal successors, (72), 6 states have internal predecessors, (72), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-02-06 03:19:09,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:19:09,296 INFO L93 Difference]: Finished difference Result 522 states and 769 transitions. [2025-02-06 03:19:09,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-06 03:19:09,297 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.285714285714286) internal successors, (72), 6 states have internal predecessors, (72), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 156 [2025-02-06 03:19:09,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:19:09,298 INFO L225 Difference]: With dead ends: 522 [2025-02-06 03:19:09,298 INFO L226 Difference]: Without dead ends: 264 [2025-02-06 03:19:09,299 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 150 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2025-02-06 03:19:09,300 INFO L435 NwaCegarLoop]: 186 mSDtfsCounter, 385 mSDsluCounter, 530 mSDsCounter, 0 mSdLazyCounter, 450 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 385 SdHoareTripleChecker+Valid, 716 SdHoareTripleChecker+Invalid, 454 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 450 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.4s IncrementalHoareTripleChecker+Time [2025-02-06 03:19:09,300 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [385 Valid, 716 Invalid, 454 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 450 Invalid, 0 Unknown, 0 Unchecked, 3.4s Time] [2025-02-06 03:19:09,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 264 states. [2025-02-06 03:19:09,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 264 to 261. [2025-02-06 03:19:09,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 261 states, 222 states have (on average 1.4054054054054055) internal successors, (312), 223 states have internal predecessors, (312), 36 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (36), 35 states have call predecessors, (36), 36 states have call successors, (36) [2025-02-06 03:19:09,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 261 states and 384 transitions. [2025-02-06 03:19:09,315 INFO L78 Accepts]: Start accepts. Automaton has 261 states and 384 transitions. Word has length 156 [2025-02-06 03:19:09,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:19:09,315 INFO L471 AbstractCegarLoop]: Abstraction has 261 states and 384 transitions. [2025-02-06 03:19:09,315 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.285714285714286) internal successors, (72), 6 states have internal predecessors, (72), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-02-06 03:19:09,315 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 384 transitions. [2025-02-06 03:19:09,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2025-02-06 03:19:09,317 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:19:09,317 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-06 03:19:09,330 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2025-02-06 03:19:09,522 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate-jdk21/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-02-06 03:19:09,522 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:19:09,522 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:19:09,523 INFO L85 PathProgramCache]: Analyzing trace with hash -391375939, now seen corresponding path program 1 times [2025-02-06 03:19:09,523 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 03:19:09,523 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1672226120] [2025-02-06 03:19:09,524 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:19:09,524 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-02-06 03:19:09,524 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 03:19:09,529 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/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-02-06 03:19:09,529 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/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-02-06 03:19:09,630 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 156 statements into 1 equivalence classes. [2025-02-06 03:19:09,873 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 156 of 156 statements. [2025-02-06 03:19:09,873 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:19:09,873 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:19:09,885 INFO L256 TraceCheckSpWp]: Trace formula consists of 344 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-06 03:19:09,888 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:19:09,909 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-02-06 03:19:09,909 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 03:19:09,909 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 03:19:09,909 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1672226120] [2025-02-06 03:19:09,909 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1672226120] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:19:09,909 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:19:09,909 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 03:19:09,909 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [422775494] [2025-02-06 03:19:09,909 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:19:09,910 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 03:19:09,910 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 03:19:09,910 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 03:19:09,910 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 03:19:09,910 INFO L87 Difference]: Start difference. First operand 261 states and 384 transitions. Second operand has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-02-06 03:19:09,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:19:09,934 INFO L93 Difference]: Finished difference Result 523 states and 771 transitions. [2025-02-06 03:19:09,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 03:19:09,935 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 156 [2025-02-06 03:19:09,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:19:09,937 INFO L225 Difference]: With dead ends: 523 [2025-02-06 03:19:09,937 INFO L226 Difference]: Without dead ends: 265 [2025-02-06 03:19:09,938 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 153 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-02-06 03:19:09,938 INFO L435 NwaCegarLoop]: 196 mSDtfsCounter, 0 mSDsluCounter, 381 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 577 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 03:19:09,939 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 577 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 03:19:09,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 265 states. [2025-02-06 03:19:09,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 265 to 265. [2025-02-06 03:19:09,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 265 states, 226 states have (on average 1.3982300884955752) internal successors, (316), 227 states have internal predecessors, (316), 36 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (36), 35 states have call predecessors, (36), 36 states have call successors, (36) [2025-02-06 03:19:09,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 388 transitions. [2025-02-06 03:19:09,951 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 388 transitions. Word has length 156 [2025-02-06 03:19:09,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:19:09,951 INFO L471 AbstractCegarLoop]: Abstraction has 265 states and 388 transitions. [2025-02-06 03:19:09,951 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-02-06 03:19:09,951 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 388 transitions. [2025-02-06 03:19:09,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2025-02-06 03:19:09,956 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:19:09,956 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-06 03:19:09,969 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2025-02-06 03:19:10,156 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/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-02-06 03:19:10,157 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:19:10,158 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:19:10,158 INFO L85 PathProgramCache]: Analyzing trace with hash -1736041061, now seen corresponding path program 1 times [2025-02-06 03:19:10,158 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 03:19:10,158 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1733554536] [2025-02-06 03:19:10,158 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:19:10,159 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-02-06 03:19:10,159 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 03:19:10,163 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/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-02-06 03:19:10,165 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2025-02-06 03:19:10,257 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 158 statements into 1 equivalence classes. [2025-02-06 03:19:10,512 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 158 of 158 statements. [2025-02-06 03:19:10,512 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:19:10,512 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:19:10,526 INFO L256 TraceCheckSpWp]: Trace formula consists of 350 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-02-06 03:19:10,530 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:19:10,771 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 24 [2025-02-06 03:19:10,887 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 03:19:10,888 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 50 treesize of output 26 [2025-02-06 03:19:10,904 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 83 proven. 48 refuted. 0 times theorem prover too weak. 481 trivial. 0 not checked. [2025-02-06 03:19:10,904 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 03:19:11,196 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 3 proven. 48 refuted. 0 times theorem prover too weak. 561 trivial. 0 not checked. [2025-02-06 03:19:11,197 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 03:19:11,197 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1733554536] [2025-02-06 03:19:11,197 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1733554536] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 03:19:11,197 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-06 03:19:11,197 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 12 [2025-02-06 03:19:11,197 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1369599437] [2025-02-06 03:19:11,197 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-06 03:19:11,198 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-02-06 03:19:11,198 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 03:19:11,198 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-02-06 03:19:11,198 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2025-02-06 03:19:11,198 INFO L87 Difference]: Start difference. First operand 265 states and 388 transitions. Second operand has 12 states, 10 states have (on average 9.6) internal successors, (96), 12 states have internal predecessors, (96), 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-02-06 03:19:11,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:19:11,888 INFO L93 Difference]: Finished difference Result 543 states and 787 transitions. [2025-02-06 03:19:11,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-02-06 03:19:11,888 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 10 states have (on average 9.6) internal successors, (96), 12 states have internal predecessors, (96), 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 158 [2025-02-06 03:19:11,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:19:11,890 INFO L225 Difference]: With dead ends: 543 [2025-02-06 03:19:11,890 INFO L226 Difference]: Without dead ends: 281 [2025-02-06 03:19:11,891 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 325 GetRequests, 304 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=122, Invalid=340, Unknown=0, NotChecked=0, Total=462 [2025-02-06 03:19:11,891 INFO L435 NwaCegarLoop]: 169 mSDtfsCounter, 301 mSDsluCounter, 664 mSDsCounter, 0 mSdLazyCounter, 254 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 302 SdHoareTripleChecker+Valid, 833 SdHoareTripleChecker+Invalid, 297 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 254 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-06 03:19:11,891 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [302 Valid, 833 Invalid, 297 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 254 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-06 03:19:11,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2025-02-06 03:19:11,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 273. [2025-02-06 03:19:11,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 273 states, 232 states have (on average 1.3793103448275863) internal successors, (320), 233 states have internal predecessors, (320), 36 states have call successors, (36), 4 states have call predecessors, (36), 4 states have return successors, (36), 35 states have call predecessors, (36), 36 states have call successors, (36) [2025-02-06 03:19:11,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 273 states to 273 states and 392 transitions. [2025-02-06 03:19:11,909 INFO L78 Accepts]: Start accepts. Automaton has 273 states and 392 transitions. Word has length 158 [2025-02-06 03:19:11,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:19:11,910 INFO L471 AbstractCegarLoop]: Abstraction has 273 states and 392 transitions. [2025-02-06 03:19:11,910 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 10 states have (on average 9.6) internal successors, (96), 12 states have internal predecessors, (96), 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-02-06 03:19:11,910 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 392 transitions. [2025-02-06 03:19:11,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2025-02-06 03:19:11,911 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:19:11,912 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-06 03:19:11,922 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2025-02-06 03:19:12,112 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/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-02-06 03:19:12,113 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:19:12,113 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:19:12,113 INFO L85 PathProgramCache]: Analyzing trace with hash 1561853882, now seen corresponding path program 1 times [2025-02-06 03:19:12,113 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 03:19:12,114 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2024286355] [2025-02-06 03:19:12,114 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:19:12,114 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-02-06 03:19:12,114 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 03:19:12,116 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/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-02-06 03:19:12,119 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/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-02-06 03:19:12,216 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 158 statements into 1 equivalence classes. [2025-02-06 03:19:12,462 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 158 of 158 statements. [2025-02-06 03:19:12,462 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:19:12,462 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:19:12,476 INFO L256 TraceCheckSpWp]: Trace formula consists of 348 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-06 03:19:12,478 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:19:12,493 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-02-06 03:19:12,493 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 03:19:12,493 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 03:19:12,493 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2024286355] [2025-02-06 03:19:12,493 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2024286355] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:19:12,493 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:19:12,496 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 03:19:12,496 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1784007890] [2025-02-06 03:19:12,496 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:19:12,497 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 03:19:12,497 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 03:19:12,497 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 03:19:12,497 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 03:19:12,497 INFO L87 Difference]: Start difference. First operand 273 states and 392 transitions. Second operand has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-02-06 03:19:12,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:19:12,525 INFO L93 Difference]: Finished difference Result 549 states and 789 transitions. [2025-02-06 03:19:12,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 03:19:12,526 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 158 [2025-02-06 03:19:12,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:19:12,528 INFO L225 Difference]: With dead ends: 549 [2025-02-06 03:19:12,528 INFO L226 Difference]: Without dead ends: 279 [2025-02-06 03:19:12,529 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 155 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-02-06 03:19:12,530 INFO L435 NwaCegarLoop]: 194 mSDtfsCounter, 1 mSDsluCounter, 377 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 571 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 03:19:12,530 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 571 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 03:19:12,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2025-02-06 03:19:12,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 277. [2025-02-06 03:19:12,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 277 states, 236 states have (on average 1.3728813559322033) internal successors, (324), 237 states have internal predecessors, (324), 36 states have call successors, (36), 4 states have call predecessors, (36), 4 states have return successors, (36), 35 states have call predecessors, (36), 36 states have call successors, (36) [2025-02-06 03:19:12,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 277 states and 396 transitions. [2025-02-06 03:19:12,561 INFO L78 Accepts]: Start accepts. Automaton has 277 states and 396 transitions. Word has length 158 [2025-02-06 03:19:12,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:19:12,562 INFO L471 AbstractCegarLoop]: Abstraction has 277 states and 396 transitions. [2025-02-06 03:19:12,562 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-02-06 03:19:12,562 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 396 transitions. [2025-02-06 03:19:12,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2025-02-06 03:19:12,563 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:19:12,563 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-06 03:19:12,575 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/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)] Forceful destruction successful, exit code 0 [2025-02-06 03:19:12,764 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/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-02-06 03:19:12,764 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:19:12,765 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:19:12,765 INFO L85 PathProgramCache]: Analyzing trace with hash 1268450875, now seen corresponding path program 1 times [2025-02-06 03:19:12,765 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 03:19:12,765 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1165915246] [2025-02-06 03:19:12,765 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:19:12,765 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-02-06 03:19:12,766 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 03:19:12,768 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/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-02-06 03:19:12,769 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/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-02-06 03:19:12,867 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 158 statements into 1 equivalence classes. [2025-02-06 03:19:13,118 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 158 of 158 statements. [2025-02-06 03:19:13,119 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:19:13,119 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:19:13,132 INFO L256 TraceCheckSpWp]: Trace formula consists of 345 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-02-06 03:19:13,134 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:19:13,155 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-02-06 03:19:13,156 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 03:19:13,156 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 03:19:13,156 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1165915246] [2025-02-06 03:19:13,156 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1165915246] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:19:13,156 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:19:13,156 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 03:19:13,156 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [661571532] [2025-02-06 03:19:13,156 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:19:13,156 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 03:19:13,156 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 03:19:13,157 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 03:19:13,157 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-06 03:19:13,157 INFO L87 Difference]: Start difference. First operand 277 states and 396 transitions. Second operand has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 6 states have internal predecessors, (71), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-02-06 03:19:13,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:19:13,205 INFO L93 Difference]: Finished difference Result 561 states and 803 transitions. [2025-02-06 03:19:13,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 03:19:13,205 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 6 states have internal predecessors, (71), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 158 [2025-02-06 03:19:13,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:19:13,207 INFO L225 Difference]: With dead ends: 561 [2025-02-06 03:19:13,207 INFO L226 Difference]: Without dead ends: 287 [2025-02-06 03:19:13,207 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 153 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-06 03:19:13,208 INFO L435 NwaCegarLoop]: 190 mSDtfsCounter, 1 mSDsluCounter, 740 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 930 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 03:19:13,208 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 930 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 03:19:13,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 287 states. [2025-02-06 03:19:13,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 287 to 285. [2025-02-06 03:19:13,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 285 states, 244 states have (on average 1.360655737704918) internal successors, (332), 245 states have internal predecessors, (332), 36 states have call successors, (36), 4 states have call predecessors, (36), 4 states have return successors, (36), 35 states have call predecessors, (36), 36 states have call successors, (36) [2025-02-06 03:19:13,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 285 states to 285 states and 404 transitions. [2025-02-06 03:19:13,219 INFO L78 Accepts]: Start accepts. Automaton has 285 states and 404 transitions. Word has length 158 [2025-02-06 03:19:13,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:19:13,219 INFO L471 AbstractCegarLoop]: Abstraction has 285 states and 404 transitions. [2025-02-06 03:19:13,219 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 6 states have internal predecessors, (71), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-02-06 03:19:13,219 INFO L276 IsEmpty]: Start isEmpty. Operand 285 states and 404 transitions. [2025-02-06 03:19:13,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2025-02-06 03:19:13,220 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:19:13,221 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-06 03:19:13,235 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/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-02-06 03:19:13,421 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate-jdk21/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-02-06 03:19:13,421 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:19:13,421 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:19:13,422 INFO L85 PathProgramCache]: Analyzing trace with hash -539003588, now seen corresponding path program 1 times [2025-02-06 03:19:13,422 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 03:19:13,422 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1954936618] [2025-02-06 03:19:13,422 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:19:13,422 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-02-06 03:19:13,422 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 03:19:13,427 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-jdk21/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-02-06 03:19:13,428 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/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-02-06 03:19:13,527 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 158 statements into 1 equivalence classes. [2025-02-06 03:19:13,795 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 158 of 158 statements. [2025-02-06 03:19:13,795 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:19:13,795 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:19:13,809 INFO L256 TraceCheckSpWp]: Trace formula consists of 343 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-06 03:19:13,811 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:19:13,842 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-02-06 03:19:13,842 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 03:19:13,842 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 03:19:13,842 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1954936618] [2025-02-06 03:19:13,842 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1954936618] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:19:13,842 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:19:13,842 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-06 03:19:13,842 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [772231945] [2025-02-06 03:19:13,842 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:19:13,843 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-06 03:19:13,843 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 03:19:13,843 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-06 03:19:13,843 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-02-06 03:19:13,843 INFO L87 Difference]: Start difference. First operand 285 states and 404 transitions. Second operand has 7 states, 7 states have (on average 10.142857142857142) internal successors, (71), 7 states have internal predecessors, (71), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-02-06 03:19:13,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:19:13,902 INFO L93 Difference]: Finished difference Result 573 states and 813 transitions. [2025-02-06 03:19:13,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-06 03:19:13,902 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.142857142857142) internal successors, (71), 7 states have internal predecessors, (71), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 158 [2025-02-06 03:19:13,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:19:13,904 INFO L225 Difference]: With dead ends: 573 [2025-02-06 03:19:13,904 INFO L226 Difference]: Without dead ends: 291 [2025-02-06 03:19:13,904 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 152 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-02-06 03:19:13,905 INFO L435 NwaCegarLoop]: 188 mSDtfsCounter, 1 mSDsluCounter, 916 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 1104 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 03:19:13,905 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 1104 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 03:19:13,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291 states. [2025-02-06 03:19:13,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291 to 289. [2025-02-06 03:19:13,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 289 states, 248 states have (on average 1.3548387096774193) internal successors, (336), 249 states have internal predecessors, (336), 36 states have call successors, (36), 4 states have call predecessors, (36), 4 states have return successors, (36), 35 states have call predecessors, (36), 36 states have call successors, (36) [2025-02-06 03:19:13,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 289 states to 289 states and 408 transitions. [2025-02-06 03:19:13,920 INFO L78 Accepts]: Start accepts. Automaton has 289 states and 408 transitions. Word has length 158 [2025-02-06 03:19:13,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:19:13,920 INFO L471 AbstractCegarLoop]: Abstraction has 289 states and 408 transitions. [2025-02-06 03:19:13,921 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.142857142857142) internal successors, (71), 7 states have internal predecessors, (71), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-02-06 03:19:13,921 INFO L276 IsEmpty]: Start isEmpty. Operand 289 states and 408 transitions. [2025-02-06 03:19:13,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2025-02-06 03:19:13,922 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:19:13,922 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-06 03:19:13,935 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Ended with exit code 0 [2025-02-06 03:19:14,122 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate-jdk21/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-02-06 03:19:14,122 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:19:14,123 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:19:14,123 INFO L85 PathProgramCache]: Analyzing trace with hash 348500093, now seen corresponding path program 1 times [2025-02-06 03:19:14,123 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 03:19:14,123 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1414354267] [2025-02-06 03:19:14,123 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:19:14,123 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-02-06 03:19:14,123 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 03:19:14,125 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-jdk21/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-02-06 03:19:14,126 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2025-02-06 03:19:14,233 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 158 statements into 1 equivalence classes. [2025-02-06 03:19:14,489 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 158 of 158 statements. [2025-02-06 03:19:14,489 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 03:19:14,489 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 03:19:14,501 INFO L256 TraceCheckSpWp]: Trace formula consists of 340 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-02-06 03:19:14,503 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 03:19:14,560 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-02-06 03:19:14,560 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 03:19:14,560 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-02-06 03:19:14,560 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1414354267] [2025-02-06 03:19:14,560 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1414354267] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 03:19:14,560 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 03:19:14,560 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-06 03:19:14,560 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1792428057] [2025-02-06 03:19:14,560 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 03:19:14,561 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-06 03:19:14,561 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-02-06 03:19:14,561 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-06 03:19:14,561 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-02-06 03:19:14,561 INFO L87 Difference]: Start difference. First operand 289 states and 408 transitions. Second operand has 8 states, 8 states have (on average 8.875) internal successors, (71), 8 states have internal predecessors, (71), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-02-06 03:19:14,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 03:19:14,629 INFO L93 Difference]: Finished difference Result 581 states and 821 transitions. [2025-02-06 03:19:14,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-06 03:19:14,630 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.875) internal successors, (71), 8 states have internal predecessors, (71), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 158 [2025-02-06 03:19:14,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 03:19:14,631 INFO L225 Difference]: With dead ends: 581 [2025-02-06 03:19:14,631 INFO L226 Difference]: Without dead ends: 295 [2025-02-06 03:19:14,632 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 151 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-02-06 03:19:14,632 INFO L435 NwaCegarLoop]: 186 mSDtfsCounter, 1 mSDsluCounter, 1094 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 1280 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 03:19:14,632 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 1280 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 03:19:14,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 295 states. [2025-02-06 03:19:14,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 295 to 293. [2025-02-06 03:19:14,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 293 states, 252 states have (on average 1.3492063492063493) internal successors, (340), 253 states have internal predecessors, (340), 36 states have call successors, (36), 4 states have call predecessors, (36), 4 states have return successors, (36), 35 states have call predecessors, (36), 36 states have call successors, (36) [2025-02-06 03:19:14,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 293 states to 293 states and 412 transitions. [2025-02-06 03:19:14,642 INFO L78 Accepts]: Start accepts. Automaton has 293 states and 412 transitions. Word has length 158 [2025-02-06 03:19:14,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 03:19:14,642 INFO L471 AbstractCegarLoop]: Abstraction has 293 states and 412 transitions. [2025-02-06 03:19:14,642 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.875) internal successors, (71), 8 states have internal predecessors, (71), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-02-06 03:19:14,642 INFO L276 IsEmpty]: Start isEmpty. Operand 293 states and 412 transitions. [2025-02-06 03:19:14,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2025-02-06 03:19:14,643 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 03:19:14,643 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-06 03:19:14,654 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Ended with exit code 0 [2025-02-06 03:19:14,844 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate-jdk21/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-02-06 03:19:14,844 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 03:19:14,844 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 03:19:14,844 INFO L85 PathProgramCache]: Analyzing trace with hash 349423614, now seen corresponding path program 1 times [2025-02-06 03:19:14,845 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-02-06 03:19:14,845 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1474130071] [2025-02-06 03:19:14,845 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 03:19:14,845 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-02-06 03:19:14,845 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-02-06 03:19:14,848 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate-jdk21/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-02-06 03:19:14,848 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2025-02-06 03:19:14,988 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 158 statements into 1 equivalence classes.