./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-92.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-92.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 542ccdd93fd02fba6833eecb60d813be2c92c29dfde95b4a0dcf97778701738f --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 15:28:37,758 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 15:28:37,839 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-09 15:28:37,847 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 15:28:37,847 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 15:28:37,870 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 15:28:37,871 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 15:28:37,871 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 15:28:37,872 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 15:28:37,872 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 15:28:37,873 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 15:28:37,873 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 15:28:37,874 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 15:28:37,874 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 15:28:37,874 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 15:28:37,874 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 15:28:37,875 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 15:28:37,875 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 15:28:37,875 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 15:28:37,875 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 15:28:37,875 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 15:28:37,875 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 15:28:37,875 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 15:28:37,875 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 15:28:37,876 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 15:28:37,876 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 15:28:37,876 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 15:28:37,876 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 15:28:37,876 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 15:28:37,876 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 15:28:37,876 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 15:28:37,877 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 15:28:37,877 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 15:28:37,877 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 15:28:37,877 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 15:28:37,877 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 15:28:37,877 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 15:28:37,878 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 15:28:37,878 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 15:28:37,878 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 15:28:37,878 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 15:28:37,878 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 15:28:37,878 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 15:28:37,878 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 15:28:37,878 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 15:28:37,878 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 15:28:37,879 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 15:28:37,879 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 15:28:37,879 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 -> 542ccdd93fd02fba6833eecb60d813be2c92c29dfde95b4a0dcf97778701738f [2025-01-09 15:28:38,152 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 15:28:38,161 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 15:28:38,164 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 15:28:38,165 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 15:28:38,165 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 15:28:38,167 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-92.i [2025-01-09 15:28:39,490 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/485bb34a4/b7b8c59e4b364227a3c3237d2e883f6f/FLAGc6f1ebc68 [2025-01-09 15:28:39,755 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 15:28:39,756 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-92.i [2025-01-09 15:28:39,767 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/485bb34a4/b7b8c59e4b364227a3c3237d2e883f6f/FLAGc6f1ebc68 [2025-01-09 15:28:39,779 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/485bb34a4/b7b8c59e4b364227a3c3237d2e883f6f [2025-01-09 15:28:39,781 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 15:28:39,783 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 15:28:39,784 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 15:28:39,784 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 15:28:39,787 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 15:28:39,788 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 03:28:39" (1/1) ... [2025-01-09 15:28:39,788 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2b533ee8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:28:39, skipping insertion in model container [2025-01-09 15:28:39,788 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 03:28:39" (1/1) ... [2025-01-09 15:28:39,802 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 15:28:39,937 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-92.i[916,929] [2025-01-09 15:28:40,023 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 15:28:40,041 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 15:28:40,053 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-92.i[916,929] [2025-01-09 15:28:40,111 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 15:28:40,132 INFO L204 MainTranslator]: Completed translation [2025-01-09 15:28:40,133 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:28:40 WrapperNode [2025-01-09 15:28:40,134 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 15:28:40,136 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 15:28:40,136 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 15:28:40,136 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 15:28:40,143 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:28:40" (1/1) ... [2025-01-09 15:28:40,157 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:28:40" (1/1) ... [2025-01-09 15:28:40,204 INFO L138 Inliner]: procedures = 29, calls = 159, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 454 [2025-01-09 15:28:40,204 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 15:28:40,205 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 15:28:40,205 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 15:28:40,205 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 15:28:40,214 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:28:40" (1/1) ... [2025-01-09 15:28:40,214 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:28:40" (1/1) ... [2025-01-09 15:28:40,220 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:28:40" (1/1) ... [2025-01-09 15:28:40,238 INFO L175 MemorySlicer]: Split 123 memory accesses to 7 slices as follows [2, 21, 23, 3, 61, 3, 10]. 50 percent of accesses are in the largest equivalence class. The 18 initializations are split as follows [2, 3, 3, 1, 6, 1, 2]. The 18 writes are split as follows [0, 4, 4, 1, 6, 1, 2]. [2025-01-09 15:28:40,239 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:28:40" (1/1) ... [2025-01-09 15:28:40,239 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:28:40" (1/1) ... [2025-01-09 15:28:40,258 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:28:40" (1/1) ... [2025-01-09 15:28:40,260 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:28:40" (1/1) ... [2025-01-09 15:28:40,264 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:28:40" (1/1) ... [2025-01-09 15:28:40,266 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:28:40" (1/1) ... [2025-01-09 15:28:40,272 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:28:40" (1/1) ... [2025-01-09 15:28:40,280 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 15:28:40,284 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 15:28:40,284 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 15:28:40,284 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 15:28:40,285 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:28:40" (1/1) ... [2025-01-09 15:28:40,290 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 15:28:40,300 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 15:28:40,315 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-09 15:28:40,321 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-09 15:28:40,338 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 15:28:40,339 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#0 [2025-01-09 15:28:40,339 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#1 [2025-01-09 15:28:40,339 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#2 [2025-01-09 15:28:40,339 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#3 [2025-01-09 15:28:40,340 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#4 [2025-01-09 15:28:40,340 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#5 [2025-01-09 15:28:40,340 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#6 [2025-01-09 15:28:40,340 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-01-09 15:28:40,340 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-01-09 15:28:40,340 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-01-09 15:28:40,340 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-01-09 15:28:40,340 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-01-09 15:28:40,341 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2025-01-09 15:28:40,341 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2025-01-09 15:28:40,341 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2025-01-09 15:28:40,341 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2025-01-09 15:28:40,341 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#2 [2025-01-09 15:28:40,341 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#3 [2025-01-09 15:28:40,342 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#4 [2025-01-09 15:28:40,342 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#5 [2025-01-09 15:28:40,342 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#6 [2025-01-09 15:28:40,342 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-01-09 15:28:40,342 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-01-09 15:28:40,343 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-01-09 15:28:40,343 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-01-09 15:28:40,343 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-01-09 15:28:40,343 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2025-01-09 15:28:40,343 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2025-01-09 15:28:40,343 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#0 [2025-01-09 15:28:40,343 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#1 [2025-01-09 15:28:40,344 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#2 [2025-01-09 15:28:40,345 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#3 [2025-01-09 15:28:40,345 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#4 [2025-01-09 15:28:40,345 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#5 [2025-01-09 15:28:40,345 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#6 [2025-01-09 15:28:40,345 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 15:28:40,345 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 15:28:40,345 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 15:28:40,345 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-01-09 15:28:40,345 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-01-09 15:28:40,345 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-01-09 15:28:40,345 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-01-09 15:28:40,345 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-01-09 15:28:40,345 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2025-01-09 15:28:40,345 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 15:28:40,345 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 15:28:40,515 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 15:28:40,517 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 15:28:40,942 INFO L? ?]: Removed 116 outVars from TransFormulas that were not future-live. [2025-01-09 15:28:40,942 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 15:28:40,956 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 15:28:40,956 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 15:28:40,957 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 03:28:40 BoogieIcfgContainer [2025-01-09 15:28:40,957 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 15:28:40,959 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 15:28:40,959 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 15:28:40,963 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 15:28:40,963 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 03:28:39" (1/3) ... [2025-01-09 15:28:40,964 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4396ba90 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 03:28:40, skipping insertion in model container [2025-01-09 15:28:40,964 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:28:40" (2/3) ... [2025-01-09 15:28:40,964 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4396ba90 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 03:28:40, skipping insertion in model container [2025-01-09 15:28:40,964 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 03:28:40" (3/3) ... [2025-01-09 15:28:40,966 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-a_file-92.i [2025-01-09 15:28:40,980 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 15:28:40,981 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-a_file-92.i that has 2 procedures, 112 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 15:28:41,040 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 15:28:41,050 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;@257f179a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 15:28:41,051 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 15:28:41,054 INFO L276 IsEmpty]: Start isEmpty. Operand has 112 states, 90 states have (on average 1.3666666666666667) internal successors, (123), 91 states have internal predecessors, (123), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2025-01-09 15:28:41,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2025-01-09 15:28:41,066 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:28:41,067 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:28:41,069 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:28:41,074 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:28:41,074 INFO L85 PathProgramCache]: Analyzing trace with hash -214823962, now seen corresponding path program 1 times [2025-01-09 15:28:41,080 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:28:41,081 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1908073263] [2025-01-09 15:28:41,081 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:28:41,081 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:28:41,204 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 153 statements into 1 equivalence classes. [2025-01-09 15:28:41,242 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 153 of 153 statements. [2025-01-09 15:28:41,243 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:28:41,243 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:28:41,444 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 648 trivial. 0 not checked. [2025-01-09 15:28:41,445 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:28:41,446 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1908073263] [2025-01-09 15:28:41,447 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1908073263] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 15:28:41,447 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1752476555] [2025-01-09 15:28:41,447 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:28:41,447 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 15:28:41,447 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 15:28:41,451 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 15:28:41,453 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-01-09 15:28:41,612 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 153 statements into 1 equivalence classes. [2025-01-09 15:28:41,721 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 153 of 153 statements. [2025-01-09 15:28:41,722 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:28:41,722 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:28:41,726 INFO L256 TraceCheckSpWp]: Trace formula consists of 543 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 15:28:41,734 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 15:28:41,763 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 648 trivial. 0 not checked. [2025-01-09 15:28:41,764 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 15:28:41,764 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1752476555] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:28:41,764 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 15:28:41,765 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-01-09 15:28:41,766 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [654303076] [2025-01-09 15:28:41,766 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:28:41,770 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 15:28:41,770 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:28:41,781 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 15:28:41,782 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 15:28:41,783 INFO L87 Difference]: Start difference. First operand has 112 states, 90 states have (on average 1.3666666666666667) internal successors, (123), 91 states have internal predecessors, (123), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) Second operand has 2 states, 2 states have (on average 31.5) internal successors, (63), 2 states have internal predecessors, (63), 2 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2025-01-09 15:28:41,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:28:41,807 INFO L93 Difference]: Finished difference Result 218 states and 336 transitions. [2025-01-09 15:28:41,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 15:28:41,809 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 31.5) internal successors, (63), 2 states have internal predecessors, (63), 2 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) Word has length 153 [2025-01-09 15:28:41,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:28:41,814 INFO L225 Difference]: With dead ends: 218 [2025-01-09 15:28:41,815 INFO L226 Difference]: Without dead ends: 109 [2025-01-09 15:28:41,818 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 154 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 15:28:41,820 INFO L435 NwaCegarLoop]: 156 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, 156 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 15:28:41,821 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 156 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 15:28:41,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2025-01-09 15:28:41,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2025-01-09 15:28:41,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 88 states have (on average 1.3409090909090908) internal successors, (118), 88 states have internal predecessors, (118), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2025-01-09 15:28:41,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 156 transitions. [2025-01-09 15:28:41,867 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 156 transitions. Word has length 153 [2025-01-09 15:28:41,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:28:41,868 INFO L471 AbstractCegarLoop]: Abstraction has 109 states and 156 transitions. [2025-01-09 15:28:41,868 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 31.5) internal successors, (63), 2 states have internal predecessors, (63), 2 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2025-01-09 15:28:41,868 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 156 transitions. [2025-01-09 15:28:41,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2025-01-09 15:28:41,874 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:28:41,875 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:28:41,884 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-01-09 15:28:42,079 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-01-09 15:28:42,079 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:28:42,080 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:28:42,080 INFO L85 PathProgramCache]: Analyzing trace with hash 1771129668, now seen corresponding path program 1 times [2025-01-09 15:28:42,080 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:28:42,080 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1592053777] [2025-01-09 15:28:42,080 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:28:42,080 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:28:42,116 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 153 statements into 1 equivalence classes. [2025-01-09 15:28:42,205 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 153 of 153 statements. [2025-01-09 15:28:42,205 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:28:42,205 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:28:42,517 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-01-09 15:28:42,518 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:28:42,518 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1592053777] [2025-01-09 15:28:42,518 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1592053777] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:28:42,518 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:28:42,518 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 15:28:42,518 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1746368710] [2025-01-09 15:28:42,518 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:28:42,519 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 15:28:42,519 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:28:42,520 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 15:28:42,520 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 15:28:42,520 INFO L87 Difference]: Start difference. First operand 109 states and 156 transitions. Second operand has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-01-09 15:28:42,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:28:42,577 INFO L93 Difference]: Finished difference Result 218 states and 313 transitions. [2025-01-09 15:28:42,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 15:28:42,578 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 153 [2025-01-09 15:28:42,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:28:42,580 INFO L225 Difference]: With dead ends: 218 [2025-01-09 15:28:42,580 INFO L226 Difference]: Without dead ends: 112 [2025-01-09 15:28:42,581 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 15:28:42,581 INFO L435 NwaCegarLoop]: 153 mSDtfsCounter, 1 mSDsluCounter, 297 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 450 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 15:28:42,582 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 450 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 15:28:42,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2025-01-09 15:28:42,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 111. [2025-01-09 15:28:42,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 90 states have (on average 1.3333333333333333) internal successors, (120), 90 states have internal predecessors, (120), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2025-01-09 15:28:42,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 158 transitions. [2025-01-09 15:28:42,600 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 158 transitions. Word has length 153 [2025-01-09 15:28:42,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:28:42,603 INFO L471 AbstractCegarLoop]: Abstraction has 111 states and 158 transitions. [2025-01-09 15:28:42,603 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-01-09 15:28:42,603 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 158 transitions. [2025-01-09 15:28:42,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2025-01-09 15:28:42,607 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:28:42,607 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:28:42,607 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 15:28:42,608 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:28:42,608 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:28:42,608 INFO L85 PathProgramCache]: Analyzing trace with hash 1772976710, now seen corresponding path program 1 times [2025-01-09 15:28:42,608 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:28:42,608 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [492065772] [2025-01-09 15:28:42,609 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:28:42,609 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:28:42,648 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 153 statements into 1 equivalence classes. [2025-01-09 15:28:42,782 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 153 of 153 statements. [2025-01-09 15:28:42,783 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:28:42,783 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:28:43,571 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 42 proven. 12 refuted. 0 times theorem prover too weak. 630 trivial. 0 not checked. [2025-01-09 15:28:43,571 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:28:43,571 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [492065772] [2025-01-09 15:28:43,571 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [492065772] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 15:28:43,571 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1805500888] [2025-01-09 15:28:43,571 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:28:43,571 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 15:28:43,571 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 15:28:43,574 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 15:28:43,577 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-01-09 15:28:43,728 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 153 statements into 1 equivalence classes. [2025-01-09 15:28:43,821 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 153 of 153 statements. [2025-01-09 15:28:43,821 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:28:43,821 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:28:43,825 INFO L256 TraceCheckSpWp]: Trace formula consists of 539 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-01-09 15:28:43,835 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 15:28:44,017 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 81 treesize of output 67 [2025-01-09 15:28:44,026 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 93 [2025-01-09 15:28:44,815 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 17 [2025-01-09 15:28:44,940 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 15:28:44,941 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 71 treesize of output 29 [2025-01-09 15:28:44,952 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 270 proven. 12 refuted. 0 times theorem prover too weak. 402 trivial. 0 not checked. [2025-01-09 15:28:44,952 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 15:28:45,872 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 42 proven. 12 refuted. 0 times theorem prover too weak. 630 trivial. 0 not checked. [2025-01-09 15:28:45,873 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1805500888] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 15:28:45,873 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 15:28:45,873 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 7] total 12 [2025-01-09 15:28:45,873 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1178346584] [2025-01-09 15:28:45,873 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 15:28:45,874 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-01-09 15:28:45,874 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:28:45,875 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-01-09 15:28:45,875 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2025-01-09 15:28:45,875 INFO L87 Difference]: Start difference. First operand 111 states and 158 transitions. Second operand has 12 states, 9 states have (on average 8.555555555555555) internal successors, (77), 12 states have internal predecessors, (77), 5 states have call successors, (25), 2 states have call predecessors, (25), 4 states have return successors, (25), 2 states have call predecessors, (25), 5 states have call successors, (25) [2025-01-09 15:28:46,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:28:46,390 INFO L93 Difference]: Finished difference Result 231 states and 323 transitions. [2025-01-09 15:28:46,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-01-09 15:28:46,391 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 9 states have (on average 8.555555555555555) internal successors, (77), 12 states have internal predecessors, (77), 5 states have call successors, (25), 2 states have call predecessors, (25), 4 states have return successors, (25), 2 states have call predecessors, (25), 5 states have call successors, (25) Word has length 153 [2025-01-09 15:28:46,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:28:46,394 INFO L225 Difference]: With dead ends: 231 [2025-01-09 15:28:46,396 INFO L226 Difference]: Without dead ends: 123 [2025-01-09 15:28:46,398 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 322 GetRequests, 302 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=107, Invalid=273, Unknown=0, NotChecked=0, Total=380 [2025-01-09 15:28:46,401 INFO L435 NwaCegarLoop]: 103 mSDtfsCounter, 214 mSDsluCounter, 362 mSDsCounter, 0 mSdLazyCounter, 334 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 229 SdHoareTripleChecker+Valid, 465 SdHoareTripleChecker+Invalid, 377 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 334 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 15:28:46,401 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [229 Valid, 465 Invalid, 377 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 334 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 15:28:46,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2025-01-09 15:28:46,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 119. [2025-01-09 15:28:46,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 96 states have (on average 1.3020833333333333) internal successors, (125), 96 states have internal predecessors, (125), 19 states have call successors, (19), 3 states have call predecessors, (19), 3 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2025-01-09 15:28:46,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 163 transitions. [2025-01-09 15:28:46,425 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 163 transitions. Word has length 153 [2025-01-09 15:28:46,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:28:46,428 INFO L471 AbstractCegarLoop]: Abstraction has 119 states and 163 transitions. [2025-01-09 15:28:46,428 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 9 states have (on average 8.555555555555555) internal successors, (77), 12 states have internal predecessors, (77), 5 states have call successors, (25), 2 states have call predecessors, (25), 4 states have return successors, (25), 2 states have call predecessors, (25), 5 states have call successors, (25) [2025-01-09 15:28:46,428 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 163 transitions. [2025-01-09 15:28:46,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2025-01-09 15:28:46,430 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:28:46,430 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:28:46,442 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-01-09 15:28:46,630 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 15:28:46,631 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:28:46,631 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:28:46,632 INFO L85 PathProgramCache]: Analyzing trace with hash -2099288760, now seen corresponding path program 1 times [2025-01-09 15:28:46,632 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:28:46,632 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1359973365] [2025-01-09 15:28:46,632 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:28:46,632 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:28:46,658 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 153 statements into 1 equivalence classes. [2025-01-09 15:28:46,809 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 153 of 153 statements. [2025-01-09 15:28:46,809 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:28:46,809 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:28:49,047 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-01-09 15:28:49,048 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:28:49,048 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1359973365] [2025-01-09 15:28:49,048 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1359973365] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:28:49,048 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:28:49,048 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-01-09 15:28:49,051 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [557614732] [2025-01-09 15:28:49,051 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:28:49,052 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-09 15:28:49,052 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:28:49,052 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-09 15:28:49,052 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2025-01-09 15:28:49,053 INFO L87 Difference]: Start difference. First operand 119 states and 163 transitions. Second operand has 11 states, 10 states have (on average 6.1) internal successors, (61), 11 states have internal predecessors, (61), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2025-01-09 15:28:49,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:28:49,900 INFO L93 Difference]: Finished difference Result 325 states and 450 transitions. [2025-01-09 15:28:49,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-01-09 15:28:49,901 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 6.1) internal successors, (61), 11 states have internal predecessors, (61), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) Word has length 153 [2025-01-09 15:28:49,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:28:49,904 INFO L225 Difference]: With dead ends: 325 [2025-01-09 15:28:49,904 INFO L226 Difference]: Without dead ends: 209 [2025-01-09 15:28:49,905 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2025-01-09 15:28:49,905 INFO L435 NwaCegarLoop]: 177 mSDtfsCounter, 113 mSDsluCounter, 1192 mSDsCounter, 0 mSdLazyCounter, 464 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 1369 SdHoareTripleChecker+Invalid, 466 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 464 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-09 15:28:49,906 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [114 Valid, 1369 Invalid, 466 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 464 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-09 15:28:49,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2025-01-09 15:28:49,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 206. [2025-01-09 15:28:49,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 206 states, 172 states have (on average 1.3313953488372092) internal successors, (229), 173 states have internal predecessors, (229), 29 states have call successors, (29), 4 states have call predecessors, (29), 4 states have return successors, (29), 28 states have call predecessors, (29), 29 states have call successors, (29) [2025-01-09 15:28:49,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 287 transitions. [2025-01-09 15:28:49,947 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 287 transitions. Word has length 153 [2025-01-09 15:28:49,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:28:49,950 INFO L471 AbstractCegarLoop]: Abstraction has 206 states and 287 transitions. [2025-01-09 15:28:49,951 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 6.1) internal successors, (61), 11 states have internal predecessors, (61), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2025-01-09 15:28:49,951 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 287 transitions. [2025-01-09 15:28:49,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2025-01-09 15:28:49,953 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:28:49,953 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:28:49,953 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 15:28:49,953 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:28:49,954 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:28:49,954 INFO L85 PathProgramCache]: Analyzing trace with hash 915814858, now seen corresponding path program 1 times [2025-01-09 15:28:49,954 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:28:49,954 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [540845890] [2025-01-09 15:28:49,954 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:28:49,955 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:28:49,985 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 153 statements into 1 equivalence classes. [2025-01-09 15:28:50,006 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 153 of 153 statements. [2025-01-09 15:28:50,007 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:28:50,007 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:28:51,040 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-01-09 15:28:51,041 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:28:51,041 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [540845890] [2025-01-09 15:28:51,041 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [540845890] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:28:51,041 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:28:51,041 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 15:28:51,041 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [332081736] [2025-01-09 15:28:51,041 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:28:51,042 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 15:28:51,042 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:28:51,043 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 15:28:51,044 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-09 15:28:51,044 INFO L87 Difference]: Start difference. First operand 206 states and 287 transitions. Second operand has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 6 states have internal predecessors, (61), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-01-09 15:28:51,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:28:51,286 INFO L93 Difference]: Finished difference Result 413 states and 572 transitions. [2025-01-09 15:28:51,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 15:28:51,287 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 6 states have internal predecessors, (61), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 153 [2025-01-09 15:28:51,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:28:51,290 INFO L225 Difference]: With dead ends: 413 [2025-01-09 15:28:51,290 INFO L226 Difference]: Without dead ends: 210 [2025-01-09 15:28:51,290 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-01-09 15:28:51,291 INFO L435 NwaCegarLoop]: 205 mSDtfsCounter, 97 mSDsluCounter, 641 mSDsCounter, 0 mSdLazyCounter, 216 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 846 SdHoareTripleChecker+Invalid, 216 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 216 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 15:28:51,291 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [97 Valid, 846 Invalid, 216 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 216 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 15:28:51,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2025-01-09 15:28:51,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 208. [2025-01-09 15:28:51,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 208 states, 173 states have (on average 1.3179190751445087) internal successors, (228), 174 states have internal predecessors, (228), 29 states have call successors, (29), 5 states have call predecessors, (29), 5 states have return successors, (29), 28 states have call predecessors, (29), 29 states have call successors, (29) [2025-01-09 15:28:51,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 286 transitions. [2025-01-09 15:28:51,316 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 286 transitions. Word has length 153 [2025-01-09 15:28:51,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:28:51,316 INFO L471 AbstractCegarLoop]: Abstraction has 208 states and 286 transitions. [2025-01-09 15:28:51,316 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 6 states have internal predecessors, (61), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-01-09 15:28:51,317 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 286 transitions. [2025-01-09 15:28:51,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2025-01-09 15:28:51,318 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:28:51,318 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:28:51,318 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 15:28:51,319 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:28:51,319 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:28:51,319 INFO L85 PathProgramCache]: Analyzing trace with hash -176060726, now seen corresponding path program 1 times [2025-01-09 15:28:51,319 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:28:51,319 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1764132091] [2025-01-09 15:28:51,319 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:28:51,320 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:28:51,342 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 153 statements into 1 equivalence classes. [2025-01-09 15:28:51,359 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 153 of 153 statements. [2025-01-09 15:28:51,360 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:28:51,360 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:28:52,319 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-01-09 15:28:52,319 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:28:52,319 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1764132091] [2025-01-09 15:28:52,320 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1764132091] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:28:52,320 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:28:52,320 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 15:28:52,320 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [688717092] [2025-01-09 15:28:52,320 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:28:52,320 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 15:28:52,321 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:28:52,321 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 15:28:52,321 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-09 15:28:52,321 INFO L87 Difference]: Start difference. First operand 208 states and 286 transitions. Second operand has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 6 states have internal predecessors, (61), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-01-09 15:28:52,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:28:52,562 INFO L93 Difference]: Finished difference Result 419 states and 573 transitions. [2025-01-09 15:28:52,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 15:28:52,563 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 6 states have internal predecessors, (61), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 153 [2025-01-09 15:28:52,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:28:52,567 INFO L225 Difference]: With dead ends: 419 [2025-01-09 15:28:52,567 INFO L226 Difference]: Without dead ends: 214 [2025-01-09 15:28:52,568 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-01-09 15:28:52,568 INFO L435 NwaCegarLoop]: 168 mSDtfsCounter, 100 mSDsluCounter, 518 mSDsCounter, 0 mSdLazyCounter, 220 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 686 SdHoareTripleChecker+Invalid, 221 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 220 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 15:28:52,569 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 686 Invalid, 221 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 220 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 15:28:52,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2025-01-09 15:28:52,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 212. [2025-01-09 15:28:52,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 212 states, 176 states have (on average 1.3068181818181819) internal successors, (230), 177 states have internal predecessors, (230), 29 states have call successors, (29), 6 states have call predecessors, (29), 6 states have return successors, (29), 28 states have call predecessors, (29), 29 states have call successors, (29) [2025-01-09 15:28:52,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 288 transitions. [2025-01-09 15:28:52,595 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 288 transitions. Word has length 153 [2025-01-09 15:28:52,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:28:52,595 INFO L471 AbstractCegarLoop]: Abstraction has 212 states and 288 transitions. [2025-01-09 15:28:52,595 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 6 states have internal predecessors, (61), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-01-09 15:28:52,595 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 288 transitions. [2025-01-09 15:28:52,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2025-01-09 15:28:52,597 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:28:52,598 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:28:52,598 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 15:28:52,598 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:28:52,599 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:28:52,599 INFO L85 PathProgramCache]: Analyzing trace with hash -1455924404, now seen corresponding path program 1 times [2025-01-09 15:28:52,599 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:28:52,599 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [203977965] [2025-01-09 15:28:52,599 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:28:52,601 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:28:52,623 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 153 statements into 1 equivalence classes. [2025-01-09 15:28:52,694 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 153 of 153 statements. [2025-01-09 15:28:52,694 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:28:52,694 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:28:54,510 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-01-09 15:28:54,510 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:28:54,511 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [203977965] [2025-01-09 15:28:54,511 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [203977965] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:28:54,511 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:28:54,511 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-01-09 15:28:54,511 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [925121505] [2025-01-09 15:28:54,511 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:28:54,512 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 15:28:54,512 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:28:54,512 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 15:28:54,512 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-01-09 15:28:54,512 INFO L87 Difference]: Start difference. First operand 212 states and 288 transitions. Second operand has 9 states, 9 states have (on average 6.777777777777778) internal successors, (61), 9 states have internal predecessors, (61), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-01-09 15:28:55,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:28:55,108 INFO L93 Difference]: Finished difference Result 451 states and 613 transitions. [2025-01-09 15:28:55,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 15:28:55,109 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.777777777777778) internal successors, (61), 9 states have internal predecessors, (61), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 153 [2025-01-09 15:28:55,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:28:55,111 INFO L225 Difference]: With dead ends: 451 [2025-01-09 15:28:55,111 INFO L226 Difference]: Without dead ends: 242 [2025-01-09 15:28:55,111 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2025-01-09 15:28:55,113 INFO L435 NwaCegarLoop]: 240 mSDtfsCounter, 97 mSDsluCounter, 1375 mSDsCounter, 0 mSdLazyCounter, 360 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 1615 SdHoareTripleChecker+Invalid, 360 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 360 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 15:28:55,114 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [97 Valid, 1615 Invalid, 360 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 360 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 15:28:55,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2025-01-09 15:28:55,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 212. [2025-01-09 15:28:55,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 212 states, 176 states have (on average 1.3011363636363635) internal successors, (229), 177 states have internal predecessors, (229), 29 states have call successors, (29), 6 states have call predecessors, (29), 6 states have return successors, (29), 28 states have call predecessors, (29), 29 states have call successors, (29) [2025-01-09 15:28:55,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 287 transitions. [2025-01-09 15:28:55,145 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 287 transitions. Word has length 153 [2025-01-09 15:28:55,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:28:55,147 INFO L471 AbstractCegarLoop]: Abstraction has 212 states and 287 transitions. [2025-01-09 15:28:55,147 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.777777777777778) internal successors, (61), 9 states have internal predecessors, (61), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-01-09 15:28:55,147 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 287 transitions. [2025-01-09 15:28:55,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2025-01-09 15:28:55,149 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:28:55,149 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:28:55,149 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 15:28:55,149 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:28:55,150 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:28:55,150 INFO L85 PathProgramCache]: Analyzing trace with hash -1393027040, now seen corresponding path program 1 times [2025-01-09 15:28:55,150 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:28:55,150 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1305689902] [2025-01-09 15:28:55,150 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:28:55,150 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:28:55,174 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 157 statements into 1 equivalence classes. [2025-01-09 15:28:55,225 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 157 of 157 statements. [2025-01-09 15:28:55,226 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:28:55,226 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-01-09 15:28:55,230 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2056352273] [2025-01-09 15:28:55,230 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:28:55,230 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 15:28:55,230 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 15:28:55,232 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 15:28:55,235 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-01-09 15:28:55,393 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 157 statements into 1 equivalence classes. [2025-01-09 15:28:55,465 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 157 of 157 statements. [2025-01-09 15:28:55,465 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:28:55,466 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:28:55,469 INFO L256 TraceCheckSpWp]: Trace formula consists of 558 conjuncts, 33 conjuncts are in the unsatisfiable core [2025-01-09 15:28:55,476 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 15:28:55,529 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2025-01-09 15:28:55,625 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 15:28:55,626 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 23 [2025-01-09 15:28:55,679 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 15:28:55,680 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 23 [2025-01-09 15:28:55,740 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 15:28:55,740 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 23 [2025-01-09 15:28:55,944 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 110 treesize of output 88 [2025-01-09 15:28:55,952 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 15:28:55,953 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 88 treesize of output 126 [2025-01-09 15:28:56,047 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 15:28:56,049 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 79 treesize of output 41 [2025-01-09 15:28:56,629 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 15:28:56,629 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 129 treesize of output 47 [2025-01-09 15:28:56,660 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 374 proven. 63 refuted. 0 times theorem prover too weak. 247 trivial. 0 not checked. [2025-01-09 15:28:56,660 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 15:29:01,066 WARN L851 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_step_#t~mem13#1| Int)) (< 0 (+ |c_ULTIMATE.start_step_#t~bitwise16#1| (select (select |c_#memory_int#4| |c_~#signed_char_Array_0~0.base|) (+ |c_~#signed_char_Array_0~0.offset| 1)) (* |ULTIMATE.start_step_#t~mem13#1| |c_ULTIMATE.start_step_#t~bitwise16#1|)))) is different from false [2025-01-09 15:29:02,026 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 39 proven. 66 refuted. 0 times theorem prover too weak. 579 trivial. 0 not checked. [2025-01-09 15:29:02,026 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:29:02,026 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1305689902] [2025-01-09 15:29:02,027 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-01-09 15:29:02,027 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2056352273] [2025-01-09 15:29:02,027 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2056352273] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 15:29:02,027 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-09 15:29:02,028 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 27 [2025-01-09 15:29:02,028 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [781863473] [2025-01-09 15:29:02,028 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-09 15:29:02,029 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2025-01-09 15:29:02,029 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:29:02,030 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2025-01-09 15:29:02,031 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=147, Invalid=506, Unknown=1, NotChecked=48, Total=702 [2025-01-09 15:29:02,031 INFO L87 Difference]: Start difference. First operand 212 states and 287 transitions. Second operand has 27 states, 23 states have (on average 4.434782608695652) internal successors, (102), 27 states have internal predecessors, (102), 9 states have call successors, (32), 3 states have call predecessors, (32), 7 states have return successors, (32), 5 states have call predecessors, (32), 9 states have call successors, (32) [2025-01-09 15:29:03,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:29:03,251 INFO L93 Difference]: Finished difference Result 448 states and 594 transitions. [2025-01-09 15:29:03,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2025-01-09 15:29:03,252 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 23 states have (on average 4.434782608695652) internal successors, (102), 27 states have internal predecessors, (102), 9 states have call successors, (32), 3 states have call predecessors, (32), 7 states have return successors, (32), 5 states have call predecessors, (32), 9 states have call successors, (32) Word has length 157 [2025-01-09 15:29:03,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:29:03,255 INFO L225 Difference]: With dead ends: 448 [2025-01-09 15:29:03,255 INFO L226 Difference]: Without dead ends: 239 [2025-01-09 15:29:03,257 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 336 GetRequests, 288 SyntacticMatches, 2 SemanticMatches, 46 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 507 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=484, Invalid=1681, Unknown=1, NotChecked=90, Total=2256 [2025-01-09 15:29:03,258 INFO L435 NwaCegarLoop]: 136 mSDtfsCounter, 654 mSDsluCounter, 1135 mSDsCounter, 0 mSdLazyCounter, 1034 mSolverCounterSat, 70 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 668 SdHoareTripleChecker+Valid, 1271 SdHoareTripleChecker+Invalid, 1396 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 1034 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 292 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-01-09 15:29:03,258 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [668 Valid, 1271 Invalid, 1396 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 1034 Invalid, 0 Unknown, 292 Unchecked, 0.8s Time] [2025-01-09 15:29:03,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2025-01-09 15:29:03,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 230. [2025-01-09 15:29:03,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 230 states, 190 states have (on average 1.2789473684210526) internal successors, (243), 191 states have internal predecessors, (243), 29 states have call successors, (29), 10 states have call predecessors, (29), 10 states have return successors, (29), 28 states have call predecessors, (29), 29 states have call successors, (29) [2025-01-09 15:29:03,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 301 transitions. [2025-01-09 15:29:03,287 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 301 transitions. Word has length 157 [2025-01-09 15:29:03,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:29:03,287 INFO L471 AbstractCegarLoop]: Abstraction has 230 states and 301 transitions. [2025-01-09 15:29:03,288 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 23 states have (on average 4.434782608695652) internal successors, (102), 27 states have internal predecessors, (102), 9 states have call successors, (32), 3 states have call predecessors, (32), 7 states have return successors, (32), 5 states have call predecessors, (32), 9 states have call successors, (32) [2025-01-09 15:29:03,288 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 301 transitions. [2025-01-09 15:29:03,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2025-01-09 15:29:03,290 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:29:03,290 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:29:03,300 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-01-09 15:29:03,494 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 15:29:03,494 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:29:03,495 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:29:03,495 INFO L85 PathProgramCache]: Analyzing trace with hash 530200994, now seen corresponding path program 1 times [2025-01-09 15:29:03,495 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:29:03,495 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1980278568] [2025-01-09 15:29:03,495 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:29:03,495 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:29:03,515 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 157 statements into 1 equivalence classes. [2025-01-09 15:29:03,583 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 157 of 157 statements. [2025-01-09 15:29:03,583 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:29:03,583 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-01-09 15:29:03,586 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1266064878] [2025-01-09 15:29:03,587 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:29:03,587 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 15:29:03,587 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 15:29:03,589 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-01-09 15:29:03,591 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-01-09 15:29:03,735 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 157 statements into 1 equivalence classes. [2025-01-09 15:29:03,799 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 157 of 157 statements. [2025-01-09 15:29:03,799 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:29:03,799 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:29:03,802 INFO L256 TraceCheckSpWp]: Trace formula consists of 558 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-01-09 15:29:03,806 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 15:29:03,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 19 treesize of output 7 [2025-01-09 15:29:03,879 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-01-09 15:29:03,880 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 15:29:03,880 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:29:03,880 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1980278568] [2025-01-09 15:29:03,880 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-01-09 15:29:03,880 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1266064878] [2025-01-09 15:29:03,880 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1266064878] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:29:03,880 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:29:03,881 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 15:29:03,881 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1938142888] [2025-01-09 15:29:03,881 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:29:03,882 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 15:29:03,882 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:29:03,883 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 15:29:03,883 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-01-09 15:29:03,883 INFO L87 Difference]: Start difference. First operand 230 states and 301 transitions. Second operand has 7 states, 7 states have (on average 9.285714285714286) internal successors, (65), 7 states have internal predecessors, (65), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-01-09 15:29:04,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:29:04,130 INFO L93 Difference]: Finished difference Result 648 states and 850 transitions. [2025-01-09 15:29:04,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 15:29:04,130 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.285714285714286) internal successors, (65), 7 states have internal predecessors, (65), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 157 [2025-01-09 15:29:04,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:29:04,135 INFO L225 Difference]: With dead ends: 648 [2025-01-09 15:29:04,137 INFO L226 Difference]: Without dead ends: 421 [2025-01-09 15:29:04,138 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 151 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-01-09 15:29:04,138 INFO L435 NwaCegarLoop]: 182 mSDtfsCounter, 101 mSDsluCounter, 684 mSDsCounter, 0 mSdLazyCounter, 228 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 866 SdHoareTripleChecker+Invalid, 230 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 228 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 15:29:04,138 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [101 Valid, 866 Invalid, 230 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 228 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 15:29:04,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 421 states. [2025-01-09 15:29:04,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 421 to 261. [2025-01-09 15:29:04,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 261 states, 221 states have (on average 1.2850678733031675) internal successors, (284), 222 states have internal predecessors, (284), 29 states have call successors, (29), 10 states have call predecessors, (29), 10 states have return successors, (29), 28 states have call predecessors, (29), 29 states have call successors, (29) [2025-01-09 15:29:04,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 261 states and 342 transitions. [2025-01-09 15:29:04,176 INFO L78 Accepts]: Start accepts. Automaton has 261 states and 342 transitions. Word has length 157 [2025-01-09 15:29:04,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:29:04,176 INFO L471 AbstractCegarLoop]: Abstraction has 261 states and 342 transitions. [2025-01-09 15:29:04,176 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.285714285714286) internal successors, (65), 7 states have internal predecessors, (65), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-01-09 15:29:04,177 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 342 transitions. [2025-01-09 15:29:04,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2025-01-09 15:29:04,180 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:29:04,180 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:29:04,190 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-01-09 15:29:04,380 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2025-01-09 15:29:04,381 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:29:04,381 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:29:04,381 INFO L85 PathProgramCache]: Analyzing trace with hash -480916256, now seen corresponding path program 1 times [2025-01-09 15:29:04,381 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:29:04,381 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [573013149] [2025-01-09 15:29:04,381 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:29:04,381 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:29:04,401 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 157 statements into 1 equivalence classes. [2025-01-09 15:29:04,476 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 157 of 157 statements. [2025-01-09 15:29:04,477 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:29:04,477 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-01-09 15:29:04,480 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1930461410] [2025-01-09 15:29:04,480 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:29:04,480 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 15:29:04,480 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 15:29:04,483 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-01-09 15:29:04,485 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-01-09 15:29:04,656 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 157 statements into 1 equivalence classes. [2025-01-09 15:29:04,819 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 157 of 157 statements. [2025-01-09 15:29:04,820 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:29:04,820 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:29:04,823 INFO L256 TraceCheckSpWp]: Trace formula consists of 558 conjuncts, 33 conjuncts are in the unsatisfiable core [2025-01-09 15:29:04,830 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 15:29:04,838 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-01-09 15:29:04,899 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2025-01-09 15:29:04,920 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2025-01-09 15:29:04,938 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2025-01-09 15:29:04,969 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2025-01-09 15:29:05,157 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 79 treesize of output 65 [2025-01-09 15:29:05,161 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 89 [2025-01-09 15:29:05,613 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 28 [2025-01-09 15:29:05,759 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 106 treesize of output 76 [2025-01-09 15:29:05,909 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 360 proven. 33 refuted. 0 times theorem prover too weak. 291 trivial. 0 not checked. [2025-01-09 15:29:05,911 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 15:29:06,757 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 80 treesize of output 56 [2025-01-09 15:29:06,867 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:29:06,867 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [573013149] [2025-01-09 15:29:06,867 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-01-09 15:29:06,867 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1930461410] [2025-01-09 15:29:06,867 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1930461410] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 15:29:06,867 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2025-01-09 15:29:06,867 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2025-01-09 15:29:06,867 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1296710822] [2025-01-09 15:29:06,868 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2025-01-09 15:29:06,868 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-01-09 15:29:06,868 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:29:06,869 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-01-09 15:29:06,869 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=260, Unknown=0, NotChecked=0, Total=342 [2025-01-09 15:29:06,869 INFO L87 Difference]: Start difference. First operand 261 states and 342 transitions. Second operand has 13 states, 11 states have (on average 6.7272727272727275) internal successors, (74), 12 states have internal predecessors, (74), 4 states have call successors, (19), 3 states have call predecessors, (19), 4 states have return successors, (19), 3 states have call predecessors, (19), 4 states have call successors, (19) [2025-01-09 15:29:07,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:29:07,757 INFO L93 Difference]: Finished difference Result 525 states and 687 transitions. [2025-01-09 15:29:07,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-01-09 15:29:07,759 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 11 states have (on average 6.7272727272727275) internal successors, (74), 12 states have internal predecessors, (74), 4 states have call successors, (19), 3 states have call predecessors, (19), 4 states have return successors, (19), 3 states have call predecessors, (19), 4 states have call successors, (19) Word has length 157 [2025-01-09 15:29:07,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:29:07,761 INFO L225 Difference]: With dead ends: 525 [2025-01-09 15:29:07,761 INFO L226 Difference]: Without dead ends: 267 [2025-01-09 15:29:07,763 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 203 GetRequests, 179 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 126 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=167, Invalid=483, Unknown=0, NotChecked=0, Total=650 [2025-01-09 15:29:07,763 INFO L435 NwaCegarLoop]: 99 mSDtfsCounter, 195 mSDsluCounter, 475 mSDsCounter, 0 mSdLazyCounter, 543 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 203 SdHoareTripleChecker+Valid, 574 SdHoareTripleChecker+Invalid, 567 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 543 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-01-09 15:29:07,763 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [203 Valid, 574 Invalid, 567 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 543 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-01-09 15:29:07,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 267 states. [2025-01-09 15:29:07,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 267 to 261. [2025-01-09 15:29:07,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 261 states, 221 states have (on average 1.2669683257918551) internal successors, (280), 222 states have internal predecessors, (280), 29 states have call successors, (29), 10 states have call predecessors, (29), 10 states have return successors, (29), 28 states have call predecessors, (29), 29 states have call successors, (29) [2025-01-09 15:29:07,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 261 states and 338 transitions. [2025-01-09 15:29:07,792 INFO L78 Accepts]: Start accepts. Automaton has 261 states and 338 transitions. Word has length 157 [2025-01-09 15:29:07,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:29:07,793 INFO L471 AbstractCegarLoop]: Abstraction has 261 states and 338 transitions. [2025-01-09 15:29:07,793 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 11 states have (on average 6.7272727272727275) internal successors, (74), 12 states have internal predecessors, (74), 4 states have call successors, (19), 3 states have call predecessors, (19), 4 states have return successors, (19), 3 states have call predecessors, (19), 4 states have call successors, (19) [2025-01-09 15:29:07,793 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 338 transitions. [2025-01-09 15:29:07,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2025-01-09 15:29:07,795 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:29:07,795 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:29:07,807 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-01-09 15:29:07,995 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2025-01-09 15:29:07,996 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:29:07,996 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:29:07,996 INFO L85 PathProgramCache]: Analyzing trace with hash 2035017638, now seen corresponding path program 1 times [2025-01-09 15:29:07,996 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:29:07,996 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [926247405] [2025-01-09 15:29:07,996 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:29:07,996 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:29:08,018 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 159 statements into 1 equivalence classes. [2025-01-09 15:29:08,061 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 159 of 159 statements. [2025-01-09 15:29:08,061 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:29:08,062 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:29:08,324 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 9 proven. 45 refuted. 0 times theorem prover too weak. 630 trivial. 0 not checked. [2025-01-09 15:29:08,324 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:29:08,324 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [926247405] [2025-01-09 15:29:08,324 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [926247405] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 15:29:08,324 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [903829672] [2025-01-09 15:29:08,324 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:29:08,325 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 15:29:08,325 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 15:29:08,327 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-01-09 15:29:08,329 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-01-09 15:29:08,484 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 159 statements into 1 equivalence classes. [2025-01-09 15:29:08,553 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 159 of 159 statements. [2025-01-09 15:29:08,553 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:29:08,553 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:29:08,557 INFO L256 TraceCheckSpWp]: Trace formula consists of 565 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-01-09 15:29:08,561 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 15:29:08,597 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 15 [2025-01-09 15:29:08,869 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2025-01-09 15:29:08,903 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 88 proven. 51 refuted. 0 times theorem prover too weak. 545 trivial. 0 not checked. [2025-01-09 15:29:08,904 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 15:29:09,245 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 3 proven. 51 refuted. 0 times theorem prover too weak. 630 trivial. 0 not checked. [2025-01-09 15:29:09,245 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [903829672] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 15:29:09,245 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 15:29:09,245 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 9, 9] total 17 [2025-01-09 15:29:09,247 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [532498866] [2025-01-09 15:29:09,247 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 15:29:09,248 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-01-09 15:29:09,248 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:29:09,249 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-01-09 15:29:09,249 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=222, Unknown=0, NotChecked=0, Total=272 [2025-01-09 15:29:09,249 INFO L87 Difference]: Start difference. First operand 261 states and 338 transitions. Second operand has 17 states, 14 states have (on average 8.571428571428571) internal successors, (120), 17 states have internal predecessors, (120), 6 states have call successors, (55), 2 states have call predecessors, (55), 4 states have return successors, (55), 3 states have call predecessors, (55), 6 states have call successors, (55) [2025-01-09 15:29:09,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:29:09,865 INFO L93 Difference]: Finished difference Result 545 states and 695 transitions. [2025-01-09 15:29:09,865 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-01-09 15:29:09,866 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 14 states have (on average 8.571428571428571) internal successors, (120), 17 states have internal predecessors, (120), 6 states have call successors, (55), 2 states have call predecessors, (55), 4 states have return successors, (55), 3 states have call predecessors, (55), 6 states have call successors, (55) Word has length 159 [2025-01-09 15:29:09,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:29:09,868 INFO L225 Difference]: With dead ends: 545 [2025-01-09 15:29:09,868 INFO L226 Difference]: Without dead ends: 287 [2025-01-09 15:29:09,869 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 344 GetRequests, 308 SyntacticMatches, 2 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 185 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=259, Invalid=1001, Unknown=0, NotChecked=0, Total=1260 [2025-01-09 15:29:09,870 INFO L435 NwaCegarLoop]: 120 mSDtfsCounter, 270 mSDsluCounter, 779 mSDsCounter, 0 mSdLazyCounter, 459 mSolverCounterSat, 71 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 270 SdHoareTripleChecker+Valid, 899 SdHoareTripleChecker+Invalid, 530 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 71 IncrementalHoareTripleChecker+Valid, 459 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 15:29:09,870 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [270 Valid, 899 Invalid, 530 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [71 Valid, 459 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 15:29:09,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 287 states. [2025-01-09 15:29:09,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 287 to 277. [2025-01-09 15:29:09,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 277 states, 233 states have (on average 1.2188841201716738) internal successors, (284), 234 states have internal predecessors, (284), 29 states have call successors, (29), 14 states have call predecessors, (29), 14 states have return successors, (29), 28 states have call predecessors, (29), 29 states have call successors, (29) [2025-01-09 15:29:09,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 277 states and 342 transitions. [2025-01-09 15:29:09,908 INFO L78 Accepts]: Start accepts. Automaton has 277 states and 342 transitions. Word has length 159 [2025-01-09 15:29:09,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:29:09,909 INFO L471 AbstractCegarLoop]: Abstraction has 277 states and 342 transitions. [2025-01-09 15:29:09,909 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 14 states have (on average 8.571428571428571) internal successors, (120), 17 states have internal predecessors, (120), 6 states have call successors, (55), 2 states have call predecessors, (55), 4 states have return successors, (55), 3 states have call predecessors, (55), 6 states have call successors, (55) [2025-01-09 15:29:09,909 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 342 transitions. [2025-01-09 15:29:09,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2025-01-09 15:29:09,911 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:29:09,911 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:29:09,920 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-01-09 15:29:10,115 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,SelfDestructingSolverStorable10 [2025-01-09 15:29:10,115 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:29:10,115 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:29:10,116 INFO L85 PathProgramCache]: Analyzing trace with hash -831897249, now seen corresponding path program 1 times [2025-01-09 15:29:10,116 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:29:10,116 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2089254458] [2025-01-09 15:29:10,116 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:29:10,116 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:29:10,137 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 161 statements into 1 equivalence classes. [2025-01-09 15:29:10,197 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 161 of 161 statements. [2025-01-09 15:29:10,198 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:29:10,198 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-01-09 15:29:10,200 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [71746522] [2025-01-09 15:29:10,201 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:29:10,201 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 15:29:10,201 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 15:29:10,203 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-01-09 15:29:10,205 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-01-09 15:29:10,369 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 161 statements into 1 equivalence classes. [2025-01-09 15:29:10,591 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 161 of 161 statements. [2025-01-09 15:29:10,592 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:29:10,592 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 15:29:10,592 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-09 15:29:10,637 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 161 statements into 1 equivalence classes. [2025-01-09 15:29:10,960 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 161 of 161 statements. [2025-01-09 15:29:10,960 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:29:10,960 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 15:29:11,092 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-09 15:29:11,093 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-09 15:29:11,093 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-01-09 15:29:11,107 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-01-09 15:29:11,295 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 15:29:11,298 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:29:11,398 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-09 15:29:11,401 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.01 03:29:11 BoogieIcfgContainer [2025-01-09 15:29:11,401 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-09 15:29:11,402 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-09 15:29:11,402 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-09 15:29:11,402 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-09 15:29:11,403 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 03:28:40" (3/4) ... [2025-01-09 15:29:11,405 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-01-09 15:29:11,405 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-09 15:29:11,406 INFO L158 Benchmark]: Toolchain (without parser) took 31623.31ms. Allocated memory was 142.6MB in the beginning and 604.0MB in the end (delta: 461.4MB). Free memory was 104.4MB in the beginning and 530.0MB in the end (delta: -425.6MB). Peak memory consumption was 41.7MB. Max. memory is 16.1GB. [2025-01-09 15:29:11,406 INFO L158 Benchmark]: CDTParser took 0.40ms. Allocated memory is still 201.3MB. Free memory was 126.8MB in the beginning and 126.5MB in the end (delta: 307.7kB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 15:29:11,407 INFO L158 Benchmark]: CACSL2BoogieTranslator took 351.56ms. Allocated memory is still 142.6MB. Free memory was 104.4MB in the beginning and 89.7MB in the end (delta: 14.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-01-09 15:29:11,407 INFO L158 Benchmark]: Boogie Procedure Inliner took 68.60ms. Allocated memory is still 142.6MB. Free memory was 89.7MB in the beginning and 85.7MB in the end (delta: 4.0MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 15:29:11,407 INFO L158 Benchmark]: Boogie Preprocessor took 78.57ms. Allocated memory is still 142.6MB. Free memory was 85.7MB in the beginning and 81.3MB in the end (delta: 4.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 15:29:11,407 INFO L158 Benchmark]: RCFGBuilder took 672.68ms. Allocated memory is still 142.6MB. Free memory was 81.3MB in the beginning and 48.8MB in the end (delta: 32.5MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2025-01-09 15:29:11,407 INFO L158 Benchmark]: TraceAbstraction took 30442.49ms. Allocated memory was 142.6MB in the beginning and 604.0MB in the end (delta: 461.4MB). Free memory was 48.8MB in the beginning and 530.2MB in the end (delta: -481.4MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 15:29:11,407 INFO L158 Benchmark]: Witness Printer took 3.65ms. Allocated memory is still 604.0MB. Free memory was 530.2MB in the beginning and 530.0MB in the end (delta: 193.9kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 15:29:11,408 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.40ms. Allocated memory is still 201.3MB. Free memory was 126.8MB in the beginning and 126.5MB in the end (delta: 307.7kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 351.56ms. Allocated memory is still 142.6MB. Free memory was 104.4MB in the beginning and 89.7MB in the end (delta: 14.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 68.60ms. Allocated memory is still 142.6MB. Free memory was 89.7MB in the beginning and 85.7MB in the end (delta: 4.0MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 78.57ms. Allocated memory is still 142.6MB. Free memory was 85.7MB in the beginning and 81.3MB in the end (delta: 4.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 672.68ms. Allocated memory is still 142.6MB. Free memory was 81.3MB in the beginning and 48.8MB in the end (delta: 32.5MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * TraceAbstraction took 30442.49ms. Allocated memory was 142.6MB in the beginning and 604.0MB in the end (delta: 461.4MB). Free memory was 48.8MB in the beginning and 530.2MB in the end (delta: -481.4MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 3.65ms. Allocated memory is still 604.0MB. Free memory was 530.2MB in the beginning and 530.0MB in the end (delta: 193.9kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 96, overapproximation of someBinaryDOUBLEComparisonOperation at line 72, overapproximation of someBinaryDOUBLEComparisonOperation at line 70, overapproximation of someBinaryDOUBLEComparisonOperation at line 72, overapproximation of someBinaryDOUBLEComparisonOperation at line 70. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[3] = { 0, 0, 0 }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[3] = { 0, 0, 0 }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[3] = { 0, 0, 0 }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[3] = { 0, 0, 0 }; [L25-L27] double double_Array_0[3] = { 15.5, 16.65, 1000000.625 }; [L25-L27] double double_Array_0[3] = { 15.5, 16.65, 1000000.625 }; [L25-L27] double double_Array_0[3] = { 15.5, 16.65, 1000000.625 }; [L25-L27] double double_Array_0[3] = { 15.5, 16.65, 1000000.625 }; [L28-L30] float float_Array_0[1] = { 2.4 }; [L28-L30] float float_Array_0[1] = { 2.4 }; [L31-L33] signed char signed_char_Array_0[2][3] = { {10, 0, 2}, {32, 8, 32} }; [L31-L33] signed char signed_char_Array_0[2][3] = { {10, 0, 2}, {32, 8, 32} }; [L31-L33] signed char signed_char_Array_0[2][3] = { {10, 0, 2}, {32, 8, 32} }; [L31-L33] signed char signed_char_Array_0[2][3] = { {10, 0, 2}, {32, 8, 32} }; [L31-L33] signed char signed_char_Array_0[2][3] = { {10, 0, 2}, {32, 8, 32} }; [L31-L33] signed char signed_char_Array_0[2][3] = { {10, 0, 2}, {32, 8, 32} }; [L31-L33] signed char signed_char_Array_0[2][3] = { {10, 0, 2}, {32, 8, 32} }; [L34-L36] signed short int signed_short_int_Array_0[1] = { 500 }; [L34-L36] signed short int signed_short_int_Array_0[1] = { 500 }; [L37-L39] unsigned short int unsigned_short_int_Array_0[2] = { 8, 100 }; [L37-L39] unsigned short int unsigned_short_int_Array_0[2] = { 8, 100 }; [L37-L39] unsigned short int unsigned_short_int_Array_0[2] = { 8, 100 }; VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=0, signed_char_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L100] isInitial = 1 [L101] FCALL initially() [L103] FCALL updateLastVariables() [L104] CALL updateVariables() [L63] BOOL_unsigned_char_Array_0[1] = __VERIFIER_nondet_uchar() [L64] EXPR BOOL_unsigned_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L64] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[1] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L64] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[1] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L65] EXPR BOOL_unsigned_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L65] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[1] <= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L65] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[1] <= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L66] BOOL_unsigned_char_Array_0[2] = __VERIFIER_nondet_uchar() [L67] EXPR BOOL_unsigned_char_Array_0[2] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L67] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[2] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L67] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[2] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L68] EXPR BOOL_unsigned_char_Array_0[2] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L68] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[2] <= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L68] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[2] <= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L69] double_Array_0[0] = __VERIFIER_nondet_double() [L70] EXPR double_Array_0[0] [L70] EXPR double_Array_0[0] >= -922337.2036854765600e+13F && double_Array_0[0] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L70] EXPR double_Array_0[0] >= -922337.2036854765600e+13F && double_Array_0[0] <= -1.0e-20F [L70] EXPR double_Array_0[0] [L70] EXPR double_Array_0[0] >= -922337.2036854765600e+13F && double_Array_0[0] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L70] EXPR (double_Array_0[0] >= -922337.2036854765600e+13F && double_Array_0[0] <= -1.0e-20F) || (double_Array_0[0] <= 9223372.036854765600e+12F && double_Array_0[0] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L70] EXPR (double_Array_0[0] >= -922337.2036854765600e+13F && double_Array_0[0] <= -1.0e-20F) || (double_Array_0[0] <= 9223372.036854765600e+12F && double_Array_0[0] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L70] CALL assume_abort_if_not((double_Array_0[0] >= -922337.2036854765600e+13F && double_Array_0[0] <= -1.0e-20F) || (double_Array_0[0] <= 9223372.036854765600e+12F && double_Array_0[0] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L70] RET assume_abort_if_not((double_Array_0[0] >= -922337.2036854765600e+13F && double_Array_0[0] <= -1.0e-20F) || (double_Array_0[0] <= 9223372.036854765600e+12F && double_Array_0[0] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L71] double_Array_0[1] = __VERIFIER_nondet_double() [L72] EXPR double_Array_0[1] [L72] EXPR double_Array_0[1] >= -922337.2036854765600e+13F && double_Array_0[1] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L72] EXPR double_Array_0[1] >= -922337.2036854765600e+13F && double_Array_0[1] <= -1.0e-20F [L72] EXPR double_Array_0[1] [L72] EXPR double_Array_0[1] >= -922337.2036854765600e+13F && double_Array_0[1] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L72] EXPR (double_Array_0[1] >= -922337.2036854765600e+13F && double_Array_0[1] <= -1.0e-20F) || (double_Array_0[1] <= 9223372.036854765600e+12F && double_Array_0[1] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L72] EXPR (double_Array_0[1] >= -922337.2036854765600e+13F && double_Array_0[1] <= -1.0e-20F) || (double_Array_0[1] <= 9223372.036854765600e+12F && double_Array_0[1] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L72] CALL assume_abort_if_not((double_Array_0[1] >= -922337.2036854765600e+13F && double_Array_0[1] <= -1.0e-20F) || (double_Array_0[1] <= 9223372.036854765600e+12F && double_Array_0[1] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L72] RET assume_abort_if_not((double_Array_0[1] >= -922337.2036854765600e+13F && double_Array_0[1] <= -1.0e-20F) || (double_Array_0[1] <= 9223372.036854765600e+12F && double_Array_0[1] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L73] signed_char_Array_0[0][0] = __VERIFIER_nondet_char() [L74] EXPR signed_char_Array_0[0][0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L74] CALL assume_abort_if_not(signed_char_Array_0[0][0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L74] RET assume_abort_if_not(signed_char_Array_0[0][0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L75] EXPR signed_char_Array_0[0][0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L75] CALL assume_abort_if_not(signed_char_Array_0[0][0] <= 63) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L75] RET assume_abort_if_not(signed_char_Array_0[0][0] <= 63) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L76] signed_char_Array_0[1][0] = __VERIFIER_nondet_char() [L77] EXPR signed_char_Array_0[1][0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L77] CALL assume_abort_if_not(signed_char_Array_0[1][0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L77] RET assume_abort_if_not(signed_char_Array_0[1][0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L78] EXPR signed_char_Array_0[1][0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L78] CALL assume_abort_if_not(signed_char_Array_0[1][0] <= 63) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L78] RET assume_abort_if_not(signed_char_Array_0[1][0] <= 63) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L79] signed_char_Array_0[0][1] = __VERIFIER_nondet_char() [L80] EXPR signed_char_Array_0[0][1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L80] CALL assume_abort_if_not(signed_char_Array_0[0][1] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L80] RET assume_abort_if_not(signed_char_Array_0[0][1] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L81] EXPR signed_char_Array_0[0][1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L81] CALL assume_abort_if_not(signed_char_Array_0[0][1] <= 126) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L81] RET assume_abort_if_not(signed_char_Array_0[0][1] <= 126) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L82] signed_char_Array_0[1][1] = __VERIFIER_nondet_char() [L83] EXPR signed_char_Array_0[1][1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L83] CALL assume_abort_if_not(signed_char_Array_0[1][1] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L83] RET assume_abort_if_not(signed_char_Array_0[1][1] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L84] EXPR signed_char_Array_0[1][1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L84] CALL assume_abort_if_not(signed_char_Array_0[1][1] <= 63) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L84] RET assume_abort_if_not(signed_char_Array_0[1][1] <= 63) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L85] signed_char_Array_0[0][2] = __VERIFIER_nondet_char() [L86] EXPR signed_char_Array_0[0][2] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L86] CALL assume_abort_if_not(signed_char_Array_0[0][2] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L86] RET assume_abort_if_not(signed_char_Array_0[0][2] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L87] EXPR signed_char_Array_0[0][2] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L87] CALL assume_abort_if_not(signed_char_Array_0[0][2] <= 63) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L87] RET assume_abort_if_not(signed_char_Array_0[0][2] <= 63) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L88] unsigned_short_int_Array_0[1] = __VERIFIER_nondet_ushort() [L89] EXPR unsigned_short_int_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L89] CALL assume_abort_if_not(unsigned_short_int_Array_0[1] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L89] RET assume_abort_if_not(unsigned_short_int_Array_0[1] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L90] EXPR unsigned_short_int_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L90] CALL assume_abort_if_not(unsigned_short_int_Array_0[1] <= 65535) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L90] RET assume_abort_if_not(unsigned_short_int_Array_0[1] <= 65535) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L91] EXPR unsigned_short_int_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L91] CALL assume_abort_if_not(unsigned_short_int_Array_0[1] != 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L91] RET assume_abort_if_not(unsigned_short_int_Array_0[1] != 0) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L104] RET updateVariables() [L105] CALL step() [L43] EXPR signed_char_Array_0[0][2] [L43] EXPR signed_char_Array_0[1][1] [L43] EXPR signed_char_Array_0[0][1] [L43] EXPR signed_char_Array_0[1][0] [L43] EXPR signed_char_Array_0[0][0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L43] EXPR ((signed_char_Array_0[0][1]) > ((signed_char_Array_0[1][0] + signed_char_Array_0[0][0]))) ? (signed_char_Array_0[0][1]) : ((signed_char_Array_0[1][0] + signed_char_Array_0[0][0])) [L43] EXPR signed_char_Array_0[0][1] [L43] EXPR ((signed_char_Array_0[0][1]) > ((signed_char_Array_0[1][0] + signed_char_Array_0[0][0]))) ? (signed_char_Array_0[0][1]) : ((signed_char_Array_0[1][0] + signed_char_Array_0[0][0])) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L43] signed_char_Array_0[1][2] = ((signed_char_Array_0[0][2] + signed_char_Array_0[1][1]) - ((((signed_char_Array_0[0][1]) > ((signed_char_Array_0[1][0] + signed_char_Array_0[0][0]))) ? (signed_char_Array_0[0][1]) : ((signed_char_Array_0[1][0] + signed_char_Array_0[0][0]))))) [L44] EXPR signed_char_Array_0[1][0] [L44] EXPR signed_char_Array_0[0][0] [L44] EXPR signed_char_Array_0[1][1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L44] EXPR signed_char_Array_0[0][0] & signed_char_Array_0[1][1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L44] signed long int stepLocal_0 = (~ signed_char_Array_0[1][0]) * (signed_char_Array_0[0][0] & signed_char_Array_0[1][1]); [L45] EXPR signed_char_Array_0[0][1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L45] COND FALSE !(stepLocal_0 >= signed_char_Array_0[0][1]) [L48] EXPR double_Array_0[0] [L48] double_Array_0[2] = double_Array_0[0] [L50] EXPR signed_char_Array_0[0][2] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L50] EXPR ((signed_char_Array_0[0][2]) < 0 ) ? -(signed_char_Array_0[0][2]) : (signed_char_Array_0[0][2]) [L50] EXPR signed_char_Array_0[0][2] [L50] EXPR ((signed_char_Array_0[0][2]) < 0 ) ? -(signed_char_Array_0[0][2]) : (signed_char_Array_0[0][2]) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L50] signed_short_int_Array_0[0] = ((((signed_char_Array_0[0][2]) < 0 ) ? -(signed_char_Array_0[0][2]) : (signed_char_Array_0[0][2]))) [L51] EXPR signed_char_Array_0[0][0] [L51] EXPR unsigned_short_int_Array_0[1] [L51] signed long int stepLocal_1 = signed_char_Array_0[0][0] / unsigned_short_int_Array_0[1]; [L52] COND FALSE !(stepLocal_1 < -100) [L55] EXPR BOOL_unsigned_char_Array_0[2] [L55] EXPR BOOL_unsigned_char_Array_0[2] && BOOL_unsigned_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L55] EXPR BOOL_unsigned_char_Array_0[2] && BOOL_unsigned_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L55] BOOL_unsigned_char_Array_0[0] = (BOOL_unsigned_char_Array_0[2] && BOOL_unsigned_char_Array_0[1]) [L57] EXPR double_Array_0[1] [L57] float_Array_0[0] = double_Array_0[1] [L58] EXPR BOOL_unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L58] COND TRUE ! BOOL_unsigned_char_Array_0[0] [L59] EXPR signed_char_Array_0[1][0] [L59] EXPR signed_char_Array_0[0][0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L59] EXPR ((signed_char_Array_0[0][0]) > (1)) ? (signed_char_Array_0[0][0]) : (1) [L59] EXPR signed_char_Array_0[0][0] [L59] EXPR ((signed_char_Array_0[0][0]) > (1)) ? (signed_char_Array_0[0][0]) : (1) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L59] unsigned_short_int_Array_0[0] = (signed_char_Array_0[1][0] + (((((signed_char_Array_0[0][0]) > (1)) ? (signed_char_Array_0[0][0]) : (1))) + 64)) [L105] RET step() [L106] CALL, EXPR property() [L96] EXPR signed_char_Array_0[1][2] [L96] EXPR signed_char_Array_0[0][2] [L96] EXPR signed_char_Array_0[1][1] [L96] EXPR signed_char_Array_0[0][1] [L96] EXPR signed_char_Array_0[1][0] [L96] EXPR signed_char_Array_0[0][0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L96] EXPR ((signed_char_Array_0[0][1]) > ((signed_char_Array_0[1][0] + signed_char_Array_0[0][0]))) ? (signed_char_Array_0[0][1]) : ((signed_char_Array_0[1][0] + signed_char_Array_0[0][0])) [L96] EXPR signed_char_Array_0[0][1] [L96] EXPR ((signed_char_Array_0[0][1]) > ((signed_char_Array_0[1][0] + signed_char_Array_0[0][0]))) ? (signed_char_Array_0[0][1]) : ((signed_char_Array_0[1][0] + signed_char_Array_0[0][0])) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L96] EXPR (signed_char_Array_0[1][2] == ((signed char) ((signed_char_Array_0[0][2] + signed_char_Array_0[1][1]) - ((((signed_char_Array_0[0][1]) > ((signed_char_Array_0[1][0] + signed_char_Array_0[0][0]))) ? (signed_char_Array_0[0][1]) : ((signed_char_Array_0[1][0] + signed_char_Array_0[0][0]))))))) && ((((~ signed_char_Array_0[1][0]) * (signed_char_Array_0[0][0] & signed_char_Array_0[1][1])) >= signed_char_Array_0[0][1]) ? (double_Array_0[2] == ((double) double_Array_0[1])) : (double_Array_0[2] == ((double) double_Array_0[0]))) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L96] EXPR (signed_char_Array_0[1][2] == ((signed char) ((signed_char_Array_0[0][2] + signed_char_Array_0[1][1]) - ((((signed_char_Array_0[0][1]) > ((signed_char_Array_0[1][0] + signed_char_Array_0[0][0]))) ? (signed_char_Array_0[0][1]) : ((signed_char_Array_0[1][0] + signed_char_Array_0[0][0]))))))) && ((((~ signed_char_Array_0[1][0]) * (signed_char_Array_0[0][0] & signed_char_Array_0[1][1])) >= signed_char_Array_0[0][1]) ? (double_Array_0[2] == ((double) double_Array_0[1])) : (double_Array_0[2] == ((double) double_Array_0[0]))) [L96] EXPR signed_char_Array_0[1][0] [L96] EXPR signed_char_Array_0[0][0] [L96] EXPR signed_char_Array_0[1][1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L96] EXPR signed_char_Array_0[0][0] & signed_char_Array_0[1][1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L96] EXPR signed_char_Array_0[0][1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L96] EXPR (((~ signed_char_Array_0[1][0]) * (signed_char_Array_0[0][0] & signed_char_Array_0[1][1])) >= signed_char_Array_0[0][1]) ? (double_Array_0[2] == ((double) double_Array_0[1])) : (double_Array_0[2] == ((double) double_Array_0[0])) [L96] EXPR double_Array_0[2] [L96] EXPR double_Array_0[0] [L96] EXPR (((~ signed_char_Array_0[1][0]) * (signed_char_Array_0[0][0] & signed_char_Array_0[1][1])) >= signed_char_Array_0[0][1]) ? (double_Array_0[2] == ((double) double_Array_0[1])) : (double_Array_0[2] == ((double) double_Array_0[0])) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L96] EXPR (signed_char_Array_0[1][2] == ((signed char) ((signed_char_Array_0[0][2] + signed_char_Array_0[1][1]) - ((((signed_char_Array_0[0][1]) > ((signed_char_Array_0[1][0] + signed_char_Array_0[0][0]))) ? (signed_char_Array_0[0][1]) : ((signed_char_Array_0[1][0] + signed_char_Array_0[0][0]))))))) && ((((~ signed_char_Array_0[1][0]) * (signed_char_Array_0[0][0] & signed_char_Array_0[1][1])) >= signed_char_Array_0[0][1]) ? (double_Array_0[2] == ((double) double_Array_0[1])) : (double_Array_0[2] == ((double) double_Array_0[0]))) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L96] EXPR ((signed_char_Array_0[1][2] == ((signed char) ((signed_char_Array_0[0][2] + signed_char_Array_0[1][1]) - ((((signed_char_Array_0[0][1]) > ((signed_char_Array_0[1][0] + signed_char_Array_0[0][0]))) ? (signed_char_Array_0[0][1]) : ((signed_char_Array_0[1][0] + signed_char_Array_0[0][0]))))))) && ((((~ signed_char_Array_0[1][0]) * (signed_char_Array_0[0][0] & signed_char_Array_0[1][1])) >= signed_char_Array_0[0][1]) ? (double_Array_0[2] == ((double) double_Array_0[1])) : (double_Array_0[2] == ((double) double_Array_0[0])))) && (signed_short_int_Array_0[0] == ((signed short int) ((((signed_char_Array_0[0][2]) < 0 ) ? -(signed_char_Array_0[0][2]) : (signed_char_Array_0[0][2]))))) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L96] EXPR ((signed_char_Array_0[1][2] == ((signed char) ((signed_char_Array_0[0][2] + signed_char_Array_0[1][1]) - ((((signed_char_Array_0[0][1]) > ((signed_char_Array_0[1][0] + signed_char_Array_0[0][0]))) ? (signed_char_Array_0[0][1]) : ((signed_char_Array_0[1][0] + signed_char_Array_0[0][0]))))))) && ((((~ signed_char_Array_0[1][0]) * (signed_char_Array_0[0][0] & signed_char_Array_0[1][1])) >= signed_char_Array_0[0][1]) ? (double_Array_0[2] == ((double) double_Array_0[1])) : (double_Array_0[2] == ((double) double_Array_0[0])))) && (signed_short_int_Array_0[0] == ((signed short int) ((((signed_char_Array_0[0][2]) < 0 ) ? -(signed_char_Array_0[0][2]) : (signed_char_Array_0[0][2]))))) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L96] EXPR (((signed_char_Array_0[1][2] == ((signed char) ((signed_char_Array_0[0][2] + signed_char_Array_0[1][1]) - ((((signed_char_Array_0[0][1]) > ((signed_char_Array_0[1][0] + signed_char_Array_0[0][0]))) ? (signed_char_Array_0[0][1]) : ((signed_char_Array_0[1][0] + signed_char_Array_0[0][0]))))))) && ((((~ signed_char_Array_0[1][0]) * (signed_char_Array_0[0][0] & signed_char_Array_0[1][1])) >= signed_char_Array_0[0][1]) ? (double_Array_0[2] == ((double) double_Array_0[1])) : (double_Array_0[2] == ((double) double_Array_0[0])))) && (signed_short_int_Array_0[0] == ((signed short int) ((((signed_char_Array_0[0][2]) < 0 ) ? -(signed_char_Array_0[0][2]) : (signed_char_Array_0[0][2])))))) && ((! BOOL_unsigned_char_Array_0[0]) ? (unsigned_short_int_Array_0[0] == ((unsigned short int) (signed_char_Array_0[1][0] + (((((signed_char_Array_0[0][0]) > (1)) ? (signed_char_Array_0[0][0]) : (1))) + 64)))) : 1) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L96] EXPR (((signed_char_Array_0[1][2] == ((signed char) ((signed_char_Array_0[0][2] + signed_char_Array_0[1][1]) - ((((signed_char_Array_0[0][1]) > ((signed_char_Array_0[1][0] + signed_char_Array_0[0][0]))) ? (signed_char_Array_0[0][1]) : ((signed_char_Array_0[1][0] + signed_char_Array_0[0][0]))))))) && ((((~ signed_char_Array_0[1][0]) * (signed_char_Array_0[0][0] & signed_char_Array_0[1][1])) >= signed_char_Array_0[0][1]) ? (double_Array_0[2] == ((double) double_Array_0[1])) : (double_Array_0[2] == ((double) double_Array_0[0])))) && (signed_short_int_Array_0[0] == ((signed short int) ((((signed_char_Array_0[0][2]) < 0 ) ? -(signed_char_Array_0[0][2]) : (signed_char_Array_0[0][2])))))) && ((! BOOL_unsigned_char_Array_0[0]) ? (unsigned_short_int_Array_0[0] == ((unsigned short int) (signed_char_Array_0[1][0] + (((((signed_char_Array_0[0][0]) > (1)) ? (signed_char_Array_0[0][0]) : (1))) + 64)))) : 1) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L96] EXPR ((((signed_char_Array_0[1][2] == ((signed char) ((signed_char_Array_0[0][2] + signed_char_Array_0[1][1]) - ((((signed_char_Array_0[0][1]) > ((signed_char_Array_0[1][0] + signed_char_Array_0[0][0]))) ? (signed_char_Array_0[0][1]) : ((signed_char_Array_0[1][0] + signed_char_Array_0[0][0]))))))) && ((((~ signed_char_Array_0[1][0]) * (signed_char_Array_0[0][0] & signed_char_Array_0[1][1])) >= signed_char_Array_0[0][1]) ? (double_Array_0[2] == ((double) double_Array_0[1])) : (double_Array_0[2] == ((double) double_Array_0[0])))) && (signed_short_int_Array_0[0] == ((signed short int) ((((signed_char_Array_0[0][2]) < 0 ) ? -(signed_char_Array_0[0][2]) : (signed_char_Array_0[0][2])))))) && ((! BOOL_unsigned_char_Array_0[0]) ? (unsigned_short_int_Array_0[0] == ((unsigned short int) (signed_char_Array_0[1][0] + (((((signed_char_Array_0[0][0]) > (1)) ? (signed_char_Array_0[0][0]) : (1))) + 64)))) : 1)) && (((signed_char_Array_0[0][0] / unsigned_short_int_Array_0[1]) < -100) ? (BOOL_unsigned_char_Array_0[0] == ((unsigned char) (! (! (! BOOL_unsigned_char_Array_0[2]))))) : (BOOL_unsigned_char_Array_0[0] == ((unsigned char) (BOOL_unsigned_char_Array_0[2] && BOOL_unsigned_char_Array_0[1])))) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L96] EXPR ((((signed_char_Array_0[1][2] == ((signed char) ((signed_char_Array_0[0][2] + signed_char_Array_0[1][1]) - ((((signed_char_Array_0[0][1]) > ((signed_char_Array_0[1][0] + signed_char_Array_0[0][0]))) ? (signed_char_Array_0[0][1]) : ((signed_char_Array_0[1][0] + signed_char_Array_0[0][0]))))))) && ((((~ signed_char_Array_0[1][0]) * (signed_char_Array_0[0][0] & signed_char_Array_0[1][1])) >= signed_char_Array_0[0][1]) ? (double_Array_0[2] == ((double) double_Array_0[1])) : (double_Array_0[2] == ((double) double_Array_0[0])))) && (signed_short_int_Array_0[0] == ((signed short int) ((((signed_char_Array_0[0][2]) < 0 ) ? -(signed_char_Array_0[0][2]) : (signed_char_Array_0[0][2])))))) && ((! BOOL_unsigned_char_Array_0[0]) ? (unsigned_short_int_Array_0[0] == ((unsigned short int) (signed_char_Array_0[1][0] + (((((signed_char_Array_0[0][0]) > (1)) ? (signed_char_Array_0[0][0]) : (1))) + 64)))) : 1)) && (((signed_char_Array_0[0][0] / unsigned_short_int_Array_0[1]) < -100) ? (BOOL_unsigned_char_Array_0[0] == ((unsigned char) (! (! (! BOOL_unsigned_char_Array_0[2]))))) : (BOOL_unsigned_char_Array_0[0] == ((unsigned char) (BOOL_unsigned_char_Array_0[2] && BOOL_unsigned_char_Array_0[1])))) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L96] EXPR (((((signed_char_Array_0[1][2] == ((signed char) ((signed_char_Array_0[0][2] + signed_char_Array_0[1][1]) - ((((signed_char_Array_0[0][1]) > ((signed_char_Array_0[1][0] + signed_char_Array_0[0][0]))) ? (signed_char_Array_0[0][1]) : ((signed_char_Array_0[1][0] + signed_char_Array_0[0][0]))))))) && ((((~ signed_char_Array_0[1][0]) * (signed_char_Array_0[0][0] & signed_char_Array_0[1][1])) >= signed_char_Array_0[0][1]) ? (double_Array_0[2] == ((double) double_Array_0[1])) : (double_Array_0[2] == ((double) double_Array_0[0])))) && (signed_short_int_Array_0[0] == ((signed short int) ((((signed_char_Array_0[0][2]) < 0 ) ? -(signed_char_Array_0[0][2]) : (signed_char_Array_0[0][2])))))) && ((! BOOL_unsigned_char_Array_0[0]) ? (unsigned_short_int_Array_0[0] == ((unsigned short int) (signed_char_Array_0[1][0] + (((((signed_char_Array_0[0][0]) > (1)) ? (signed_char_Array_0[0][0]) : (1))) + 64)))) : 1)) && (((signed_char_Array_0[0][0] / unsigned_short_int_Array_0[1]) < -100) ? (BOOL_unsigned_char_Array_0[0] == ((unsigned char) (! (! (! BOOL_unsigned_char_Array_0[2]))))) : (BOOL_unsigned_char_Array_0[0] == ((unsigned char) (BOOL_unsigned_char_Array_0[2] && BOOL_unsigned_char_Array_0[1]))))) && (float_Array_0[0] == ((float) double_Array_0[1])) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L96] EXPR (((((signed_char_Array_0[1][2] == ((signed char) ((signed_char_Array_0[0][2] + signed_char_Array_0[1][1]) - ((((signed_char_Array_0[0][1]) > ((signed_char_Array_0[1][0] + signed_char_Array_0[0][0]))) ? (signed_char_Array_0[0][1]) : ((signed_char_Array_0[1][0] + signed_char_Array_0[0][0]))))))) && ((((~ signed_char_Array_0[1][0]) * (signed_char_Array_0[0][0] & signed_char_Array_0[1][1])) >= signed_char_Array_0[0][1]) ? (double_Array_0[2] == ((double) double_Array_0[1])) : (double_Array_0[2] == ((double) double_Array_0[0])))) && (signed_short_int_Array_0[0] == ((signed short int) ((((signed_char_Array_0[0][2]) < 0 ) ? -(signed_char_Array_0[0][2]) : (signed_char_Array_0[0][2])))))) && ((! BOOL_unsigned_char_Array_0[0]) ? (unsigned_short_int_Array_0[0] == ((unsigned short int) (signed_char_Array_0[1][0] + (((((signed_char_Array_0[0][0]) > (1)) ? (signed_char_Array_0[0][0]) : (1))) + 64)))) : 1)) && (((signed_char_Array_0[0][0] / unsigned_short_int_Array_0[1]) < -100) ? (BOOL_unsigned_char_Array_0[0] == ((unsigned char) (! (! (! BOOL_unsigned_char_Array_0[2]))))) : (BOOL_unsigned_char_Array_0[0] == ((unsigned char) (BOOL_unsigned_char_Array_0[2] && BOOL_unsigned_char_Array_0[1]))))) && (float_Array_0[0] == ((float) double_Array_0[1])) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L96-L97] return (((((signed_char_Array_0[1][2] == ((signed char) ((signed_char_Array_0[0][2] + signed_char_Array_0[1][1]) - ((((signed_char_Array_0[0][1]) > ((signed_char_Array_0[1][0] + signed_char_Array_0[0][0]))) ? (signed_char_Array_0[0][1]) : ((signed_char_Array_0[1][0] + signed_char_Array_0[0][0]))))))) && ((((~ signed_char_Array_0[1][0]) * (signed_char_Array_0[0][0] & signed_char_Array_0[1][1])) >= signed_char_Array_0[0][1]) ? (double_Array_0[2] == ((double) double_Array_0[1])) : (double_Array_0[2] == ((double) double_Array_0[0])))) && (signed_short_int_Array_0[0] == ((signed short int) ((((signed_char_Array_0[0][2]) < 0 ) ? -(signed_char_Array_0[0][2]) : (signed_char_Array_0[0][2])))))) && ((! BOOL_unsigned_char_Array_0[0]) ? (unsigned_short_int_Array_0[0] == ((unsigned short int) (signed_char_Array_0[1][0] + (((((signed_char_Array_0[0][0]) > (1)) ? (signed_char_Array_0[0][0]) : (1))) + 64)))) : 1)) && (((signed_char_Array_0[0][0] / unsigned_short_int_Array_0[1]) < -100) ? (BOOL_unsigned_char_Array_0[0] == ((unsigned char) (! (! (! BOOL_unsigned_char_Array_0[2]))))) : (BOOL_unsigned_char_Array_0[0] == ((unsigned char) (BOOL_unsigned_char_Array_0[2] && BOOL_unsigned_char_Array_0[1]))))) && (float_Array_0[0] == ((float) double_Array_0[1])) ; [L106] RET, EXPR property() [L106] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] [L19] reach_error() VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_short_int_Array_0={8:0}, unsigned_short_int_Array_0={9:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 112 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 30.3s, OverallIterations: 12, TraceHistogramMax: 19, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 5.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1880 SdHoareTripleChecker+Valid, 3.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1842 mSDsluCounter, 9197 SdHoareTripleChecker+Invalid, 3.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 292 IncrementalHoareTripleChecker+Unchecked, 7458 mSDsCounter, 214 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3874 IncrementalHoareTripleChecker+Invalid, 4380 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 214 mSolverCounterUnsat, 1739 mSDtfsCounter, 3874 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1585 GetRequests, 1417 SyntacticMatches, 6 SemanticMatches, 162 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 885 ImplicationChecksByTransitivity, 7.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=277occurred in iteration=11, InterpolantAutomatonStates: 136, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 11 MinimizatonAttempts, 227 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.4s SsaConstructionTime, 1.6s SatisfiabilityAnalysisTime, 19.1s InterpolantComputationTime, 2959 NumberOfCodeBlocks, 2959 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 2618 ConstructedInterpolants, 2 QuantifiedInterpolants, 13250 SizeOfPredicates, 30 NumberOfNonLiveVariables, 3321 ConjunctsInSsa, 105 ConjunctsInUnsatCore, 17 InterpolantComputations, 7 PerfectInterpolantSequences, 11247/11628 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2025-01-09 15:29:11,451 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-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-92.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 542ccdd93fd02fba6833eecb60d813be2c92c29dfde95b4a0dcf97778701738f --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 15:29:13,769 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 15:29:13,865 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-01-09 15:29:13,874 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 15:29:13,874 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 15:29:13,899 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 15:29:13,900 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 15:29:13,900 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 15:29:13,900 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 15:29:13,900 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 15:29:13,900 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 15:29:13,900 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 15:29:13,901 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 15:29:13,901 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 15:29:13,901 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 15:29:13,901 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 15:29:13,901 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 15:29:13,901 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 15:29:13,902 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 15:29:13,902 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 15:29:13,902 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 15:29:13,902 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 15:29:13,902 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 15:29:13,902 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-01-09 15:29:13,902 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-01-09 15:29:13,902 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-01-09 15:29:13,903 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 15:29:13,903 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 15:29:13,903 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 15:29:13,903 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 15:29:13,903 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 15:29:13,903 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 15:29:13,903 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 15:29:13,904 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 15:29:13,904 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 15:29:13,904 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 15:29:13,904 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 15:29:13,904 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 15:29:13,904 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 15:29:13,904 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 15:29:13,904 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 15:29:13,904 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 15:29:13,905 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 15:29:13,905 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 15:29:13,905 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-01-09 15:29:13,905 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-01-09 15:29:13,905 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 15:29:13,905 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 15:29:13,905 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 15:29:13,905 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 15:29:13,905 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 -> 542ccdd93fd02fba6833eecb60d813be2c92c29dfde95b4a0dcf97778701738f [2025-01-09 15:29:14,225 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 15:29:14,236 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 15:29:14,238 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 15:29:14,240 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 15:29:14,240 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 15:29:14,241 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-92.i [2025-01-09 15:29:15,605 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/b3c1f5185/3d7947067cd64d9a814a65468af3a34d/FLAGb19dffe8a [2025-01-09 15:29:15,857 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 15:29:15,857 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-92.i [2025-01-09 15:29:15,865 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/b3c1f5185/3d7947067cd64d9a814a65468af3a34d/FLAGb19dffe8a [2025-01-09 15:29:15,885 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/b3c1f5185/3d7947067cd64d9a814a65468af3a34d [2025-01-09 15:29:15,888 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 15:29:15,890 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 15:29:15,892 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 15:29:15,892 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 15:29:15,896 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 15:29:15,897 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 03:29:15" (1/1) ... [2025-01-09 15:29:15,897 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2c95ca88 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:29:15, skipping insertion in model container [2025-01-09 15:29:15,898 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 03:29:15" (1/1) ... [2025-01-09 15:29:15,915 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 15:29:16,050 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-92.i[916,929] [2025-01-09 15:29:16,141 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 15:29:16,156 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 15:29:16,169 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-92.i[916,929] [2025-01-09 15:29:16,219 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 15:29:16,238 INFO L204 MainTranslator]: Completed translation [2025-01-09 15:29:16,239 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:29:16 WrapperNode [2025-01-09 15:29:16,239 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 15:29:16,240 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 15:29:16,240 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 15:29:16,240 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 15:29:16,245 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:29:16" (1/1) ... [2025-01-09 15:29:16,257 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:29:16" (1/1) ... [2025-01-09 15:29:16,297 INFO L138 Inliner]: procedures = 36, calls = 159, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 432 [2025-01-09 15:29:16,298 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 15:29:16,298 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 15:29:16,298 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 15:29:16,299 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 15:29:16,305 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:29:16" (1/1) ... [2025-01-09 15:29:16,305 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:29:16" (1/1) ... [2025-01-09 15:29:16,316 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:29:16" (1/1) ... [2025-01-09 15:29:16,346 INFO L175 MemorySlicer]: Split 123 memory accesses to 7 slices as follows [2, 21, 23, 3, 61, 3, 10]. 50 percent of accesses are in the largest equivalence class. The 18 initializations are split as follows [2, 3, 3, 1, 6, 1, 2]. The 18 writes are split as follows [0, 4, 4, 1, 6, 1, 2]. [2025-01-09 15:29:16,347 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:29:16" (1/1) ... [2025-01-09 15:29:16,347 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:29:16" (1/1) ... [2025-01-09 15:29:16,381 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:29:16" (1/1) ... [2025-01-09 15:29:16,382 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:29:16" (1/1) ... [2025-01-09 15:29:16,386 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:29:16" (1/1) ... [2025-01-09 15:29:16,394 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:29:16" (1/1) ... [2025-01-09 15:29:16,401 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:29:16" (1/1) ... [2025-01-09 15:29:16,407 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 15:29:16,408 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 15:29:16,408 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 15:29:16,408 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 15:29:16,409 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:29:16" (1/1) ... [2025-01-09 15:29:16,414 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 15:29:16,433 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 15:29:16,454 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-09 15:29:16,458 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-09 15:29:16,488 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 15:29:16,489 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#0 [2025-01-09 15:29:16,489 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#1 [2025-01-09 15:29:16,489 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#2 [2025-01-09 15:29:16,489 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#3 [2025-01-09 15:29:16,489 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#4 [2025-01-09 15:29:16,489 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#5 [2025-01-09 15:29:16,489 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#6 [2025-01-09 15:29:16,489 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#0 [2025-01-09 15:29:16,489 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#1 [2025-01-09 15:29:16,490 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#2 [2025-01-09 15:29:16,490 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#3 [2025-01-09 15:29:16,490 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#4 [2025-01-09 15:29:16,490 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#5 [2025-01-09 15:29:16,490 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#6 [2025-01-09 15:29:16,490 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2025-01-09 15:29:16,491 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2025-01-09 15:29:16,491 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2025-01-09 15:29:16,491 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#3 [2025-01-09 15:29:16,491 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#4 [2025-01-09 15:29:16,491 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#5 [2025-01-09 15:29:16,491 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#6 [2025-01-09 15:29:16,491 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#0 [2025-01-09 15:29:16,491 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#1 [2025-01-09 15:29:16,491 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#2 [2025-01-09 15:29:16,491 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#3 [2025-01-09 15:29:16,491 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#4 [2025-01-09 15:29:16,491 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#5 [2025-01-09 15:29:16,491 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#6 [2025-01-09 15:29:16,492 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-01-09 15:29:16,492 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2025-01-09 15:29:16,492 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2025-01-09 15:29:16,492 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#3 [2025-01-09 15:29:16,492 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#4 [2025-01-09 15:29:16,492 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#5 [2025-01-09 15:29:16,492 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#6 [2025-01-09 15:29:16,492 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#0 [2025-01-09 15:29:16,492 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#1 [2025-01-09 15:29:16,492 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#2 [2025-01-09 15:29:16,492 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#3 [2025-01-09 15:29:16,492 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#4 [2025-01-09 15:29:16,492 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#5 [2025-01-09 15:29:16,492 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#6 [2025-01-09 15:29:16,492 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#0 [2025-01-09 15:29:16,492 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#1 [2025-01-09 15:29:16,492 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#2 [2025-01-09 15:29:16,492 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#3 [2025-01-09 15:29:16,492 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#4 [2025-01-09 15:29:16,492 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#5 [2025-01-09 15:29:16,492 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#6 [2025-01-09 15:29:16,492 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#0 [2025-01-09 15:29:16,492 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#1 [2025-01-09 15:29:16,493 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#2 [2025-01-09 15:29:16,493 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#3 [2025-01-09 15:29:16,493 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#4 [2025-01-09 15:29:16,493 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#5 [2025-01-09 15:29:16,493 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#6 [2025-01-09 15:29:16,493 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#0 [2025-01-09 15:29:16,493 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#1 [2025-01-09 15:29:16,493 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#2 [2025-01-09 15:29:16,493 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#3 [2025-01-09 15:29:16,493 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#4 [2025-01-09 15:29:16,493 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#5 [2025-01-09 15:29:16,493 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#6 [2025-01-09 15:29:16,493 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#0 [2025-01-09 15:29:16,493 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#1 [2025-01-09 15:29:16,493 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#2 [2025-01-09 15:29:16,493 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#3 [2025-01-09 15:29:16,493 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#4 [2025-01-09 15:29:16,493 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#5 [2025-01-09 15:29:16,493 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#6 [2025-01-09 15:29:16,493 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 15:29:16,497 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 15:29:16,497 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 15:29:16,497 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 15:29:16,498 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2025-01-09 15:29:16,498 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2025-01-09 15:29:16,498 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#2 [2025-01-09 15:29:16,498 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#3 [2025-01-09 15:29:16,498 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#4 [2025-01-09 15:29:16,498 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#5 [2025-01-09 15:29:16,498 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#6 [2025-01-09 15:29:16,498 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#0 [2025-01-09 15:29:16,498 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#1 [2025-01-09 15:29:16,498 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#2 [2025-01-09 15:29:16,498 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#3 [2025-01-09 15:29:16,498 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#4 [2025-01-09 15:29:16,498 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#5 [2025-01-09 15:29:16,498 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#6 [2025-01-09 15:29:16,712 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 15:29:16,714 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 15:29:17,643 INFO L? ?]: Removed 106 outVars from TransFormulas that were not future-live. [2025-01-09 15:29:17,643 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 15:29:17,655 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 15:29:17,657 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 15:29:17,657 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 03:29:17 BoogieIcfgContainer [2025-01-09 15:29:17,658 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 15:29:17,659 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 15:29:17,659 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 15:29:17,665 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 15:29:17,665 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 03:29:15" (1/3) ... [2025-01-09 15:29:17,666 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3770b826 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 03:29:17, skipping insertion in model container [2025-01-09 15:29:17,666 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:29:16" (2/3) ... [2025-01-09 15:29:17,667 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3770b826 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 03:29:17, skipping insertion in model container [2025-01-09 15:29:17,667 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 03:29:17" (3/3) ... [2025-01-09 15:29:17,669 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-a_file-92.i [2025-01-09 15:29:17,683 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 15:29:17,685 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-a_file-92.i that has 2 procedures, 104 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 15:29:17,743 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 15:29:17,756 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;@5cb816ab, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 15:29:17,757 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 15:29:17,761 INFO L276 IsEmpty]: Start isEmpty. Operand has 104 states, 82 states have (on average 1.353658536585366) internal successors, (111), 83 states have internal predecessors, (111), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2025-01-09 15:29:17,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2025-01-09 15:29:17,774 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:29:17,777 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:29:17,777 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:29:17,784 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:29:17,785 INFO L85 PathProgramCache]: Analyzing trace with hash -969749078, now seen corresponding path program 1 times [2025-01-09 15:29:17,796 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 15:29:17,797 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [553727841] [2025-01-09 15:29:17,797 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:29:17,797 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-01-09 15:29:17,797 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 15:29:17,804 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-01-09 15:29:17,806 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-01-09 15:29:17,965 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 151 statements into 1 equivalence classes. [2025-01-09 15:29:18,171 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 151 of 151 statements. [2025-01-09 15:29:18,171 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:29:18,171 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:29:18,184 INFO L256 TraceCheckSpWp]: Trace formula consists of 328 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 15:29:18,191 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 15:29:18,232 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 344 proven. 0 refuted. 0 times theorem prover too weak. 340 trivial. 0 not checked. [2025-01-09 15:29:18,232 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 15:29:18,233 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 15:29:18,233 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [553727841] [2025-01-09 15:29:18,233 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [553727841] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:29:18,234 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:29:18,235 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 15:29:18,236 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1663507709] [2025-01-09 15:29:18,236 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:29:18,240 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 15:29:18,240 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 15:29:18,258 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 15:29:18,258 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 15:29:18,261 INFO L87 Difference]: Start difference. First operand has 104 states, 82 states have (on average 1.353658536585366) internal successors, (111), 83 states have internal predecessors, (111), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) Second operand has 2 states, 2 states have (on average 31.5) internal successors, (63), 2 states have internal predecessors, (63), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2025-01-09 15:29:18,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:29:18,306 INFO L93 Difference]: Finished difference Result 202 states and 312 transitions. [2025-01-09 15:29:18,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 15:29:18,307 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 31.5) internal successors, (63), 2 states have internal predecessors, (63), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) Word has length 151 [2025-01-09 15:29:18,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:29:18,313 INFO L225 Difference]: With dead ends: 202 [2025-01-09 15:29:18,313 INFO L226 Difference]: Without dead ends: 101 [2025-01-09 15:29:18,315 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 150 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 15:29:18,318 INFO L435 NwaCegarLoop]: 144 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 144 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 15:29:18,318 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 144 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 15:29:18,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2025-01-09 15:29:18,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2025-01-09 15:29:18,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 80 states have (on average 1.325) internal successors, (106), 80 states have internal predecessors, (106), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2025-01-09 15:29:18,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 144 transitions. [2025-01-09 15:29:18,358 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 144 transitions. Word has length 151 [2025-01-09 15:29:18,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:29:18,359 INFO L471 AbstractCegarLoop]: Abstraction has 101 states and 144 transitions. [2025-01-09 15:29:18,359 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 31.5) internal successors, (63), 2 states have internal predecessors, (63), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2025-01-09 15:29:18,359 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 144 transitions. [2025-01-09 15:29:18,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2025-01-09 15:29:18,362 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:29:18,362 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:29:18,375 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 (2)] Ended with exit code 0 [2025-01-09 15:29:18,563 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-01-09 15:29:18,563 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:29:18,564 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:29:18,564 INFO L85 PathProgramCache]: Analyzing trace with hash 2138459272, now seen corresponding path program 1 times [2025-01-09 15:29:18,565 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 15:29:18,565 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [213718749] [2025-01-09 15:29:18,565 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:29:18,565 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-01-09 15:29:18,565 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 15:29:18,567 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-01-09 15:29:18,568 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-01-09 15:29:18,737 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 151 statements into 1 equivalence classes. [2025-01-09 15:29:19,033 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 151 of 151 statements. [2025-01-09 15:29:19,033 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:29:19,033 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:29:19,044 INFO L256 TraceCheckSpWp]: Trace formula consists of 328 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-01-09 15:29:19,050 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 15:29:19,125 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-01-09 15:29:19,126 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 15:29:19,126 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 15:29:19,126 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [213718749] [2025-01-09 15:29:19,126 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [213718749] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:29:19,126 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:29:19,126 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 15:29:19,126 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [696444343] [2025-01-09 15:29:19,126 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:29:19,127 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 15:29:19,127 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 15:29:19,128 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 15:29:19,129 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-01-09 15:29:19,129 INFO L87 Difference]: Start difference. First operand 101 states and 144 transitions. Second operand has 7 states, 7 states have (on average 8.428571428571429) internal successors, (59), 7 states have internal predecessors, (59), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-01-09 15:29:19,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:29:19,361 INFO L93 Difference]: Finished difference Result 208 states and 298 transitions. [2025-01-09 15:29:19,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 15:29:19,362 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.428571428571429) internal successors, (59), 7 states have internal predecessors, (59), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 151 [2025-01-09 15:29:19,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:29:19,365 INFO L225 Difference]: With dead ends: 208 [2025-01-09 15:29:19,366 INFO L226 Difference]: Without dead ends: 110 [2025-01-09 15:29:19,367 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 145 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-01-09 15:29:19,368 INFO L435 NwaCegarLoop]: 135 mSDtfsCounter, 1 mSDsluCounter, 654 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 789 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 15:29:19,368 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 789 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 15:29:19,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2025-01-09 15:29:19,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 109. [2025-01-09 15:29:19,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 88 states have (on average 1.2954545454545454) internal successors, (114), 88 states have internal predecessors, (114), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2025-01-09 15:29:19,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 152 transitions. [2025-01-09 15:29:19,387 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 152 transitions. Word has length 151 [2025-01-09 15:29:19,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:29:19,389 INFO L471 AbstractCegarLoop]: Abstraction has 109 states and 152 transitions. [2025-01-09 15:29:19,390 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.428571428571429) internal successors, (59), 7 states have internal predecessors, (59), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-01-09 15:29:19,391 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 152 transitions. [2025-01-09 15:29:19,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2025-01-09 15:29:19,392 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:29:19,392 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:29:19,405 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-01-09 15:29:19,593 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-01-09 15:29:19,593 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:29:19,593 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:29:19,594 INFO L85 PathProgramCache]: Analyzing trace with hash 2140306314, now seen corresponding path program 1 times [2025-01-09 15:29:19,594 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 15:29:19,594 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [87493672] [2025-01-09 15:29:19,594 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:29:19,594 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-01-09 15:29:19,594 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 15:29:19,596 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-01-09 15:29:19,598 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-01-09 15:29:19,756 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 151 statements into 1 equivalence classes. [2025-01-09 15:29:20,171 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 151 of 151 statements. [2025-01-09 15:29:20,172 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:29:20,172 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:29:20,186 INFO L256 TraceCheckSpWp]: Trace formula consists of 325 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-01-09 15:29:20,195 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 15:29:20,241 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-01-09 15:29:20,399 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 33 treesize of output 32 [2025-01-09 15:29:20,473 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 15:29:20,473 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 39 treesize of output 21 [2025-01-09 15:29:20,618 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 270 proven. 12 refuted. 0 times theorem prover too weak. 402 trivial. 0 not checked. [2025-01-09 15:29:20,618 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 15:29:20,949 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 42 proven. 12 refuted. 0 times theorem prover too weak. 630 trivial. 0 not checked. [2025-01-09 15:29:20,949 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 15:29:20,949 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [87493672] [2025-01-09 15:29:20,950 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [87493672] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 15:29:20,950 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-09 15:29:20,950 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 12 [2025-01-09 15:29:20,950 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1435089943] [2025-01-09 15:29:20,950 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-09 15:29:20,950 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-01-09 15:29:20,950 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 15:29:20,951 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-01-09 15:29:20,951 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2025-01-09 15:29:20,954 INFO L87 Difference]: Start difference. First operand 109 states and 152 transitions. Second operand has 12 states, 10 states have (on average 7.3) internal successors, (73), 12 states have internal predecessors, (73), 4 states have call successors, (24), 2 states have call predecessors, (24), 4 states have return successors, (24), 2 states have call predecessors, (24), 4 states have call successors, (24) [2025-01-09 15:29:22,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:29:22,579 INFO L93 Difference]: Finished difference Result 227 states and 311 transitions. [2025-01-09 15:29:22,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-01-09 15:29:22,580 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 10 states have (on average 7.3) internal successors, (73), 12 states have internal predecessors, (73), 4 states have call successors, (24), 2 states have call predecessors, (24), 4 states have return successors, (24), 2 states have call predecessors, (24), 4 states have call successors, (24) Word has length 151 [2025-01-09 15:29:22,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:29:22,582 INFO L225 Difference]: With dead ends: 227 [2025-01-09 15:29:22,582 INFO L226 Difference]: Without dead ends: 121 [2025-01-09 15:29:22,583 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 308 GetRequests, 289 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=107, Invalid=273, Unknown=0, NotChecked=0, Total=380 [2025-01-09 15:29:22,583 INFO L435 NwaCegarLoop]: 93 mSDtfsCounter, 109 mSDsluCounter, 323 mSDsCounter, 0 mSdLazyCounter, 325 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 416 SdHoareTripleChecker+Invalid, 334 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 325 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-01-09 15:29:22,583 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [124 Valid, 416 Invalid, 334 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 325 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-01-09 15:29:22,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2025-01-09 15:29:22,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 117. [2025-01-09 15:29:22,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 94 states have (on average 1.2659574468085106) internal successors, (119), 94 states have internal predecessors, (119), 19 states have call successors, (19), 3 states have call predecessors, (19), 3 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2025-01-09 15:29:22,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 157 transitions. [2025-01-09 15:29:22,606 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 157 transitions. Word has length 151 [2025-01-09 15:29:22,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:29:22,606 INFO L471 AbstractCegarLoop]: Abstraction has 117 states and 157 transitions. [2025-01-09 15:29:22,607 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 10 states have (on average 7.3) internal successors, (73), 12 states have internal predecessors, (73), 4 states have call successors, (24), 2 states have call predecessors, (24), 4 states have return successors, (24), 2 states have call predecessors, (24), 4 states have call successors, (24) [2025-01-09 15:29:22,607 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 157 transitions. [2025-01-09 15:29:22,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2025-01-09 15:29:22,611 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:29:22,611 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:29:22,623 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-01-09 15:29:22,811 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-01-09 15:29:22,812 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:29:22,812 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:29:22,812 INFO L85 PathProgramCache]: Analyzing trace with hash -1731959156, now seen corresponding path program 1 times [2025-01-09 15:29:22,813 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 15:29:22,813 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [166256172] [2025-01-09 15:29:22,813 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:29:22,813 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-01-09 15:29:22,813 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 15:29:22,815 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-01-09 15:29:22,818 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-01-09 15:29:22,937 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 151 statements into 1 equivalence classes. [2025-01-09 15:29:23,377 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 151 of 151 statements. [2025-01-09 15:29:23,377 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:29:23,377 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:29:23,390 INFO L256 TraceCheckSpWp]: Trace formula consists of 325 conjuncts, 22 conjuncts are in the unsatisfiable core [2025-01-09 15:29:23,396 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 15:29:23,408 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 8 [2025-01-09 15:29:23,580 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 17 [2025-01-09 15:29:23,690 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 17 [2025-01-09 15:29:23,789 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 32 treesize of output 27 [2025-01-09 15:29:23,977 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 15:29:23,977 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 47 treesize of output 30 [2025-01-09 15:29:24,617 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 15:29:24,617 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 49 treesize of output 47 [2025-01-09 15:29:24,830 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 15:29:24,830 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 64 treesize of output 40 [2025-01-09 15:29:24,835 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 29 treesize of output 17 [2025-01-09 15:29:25,294 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 485 proven. 33 refuted. 0 times theorem prover too weak. 166 trivial. 0 not checked. [2025-01-09 15:29:25,294 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 15:29:26,818 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 20 [2025-01-09 15:29:27,118 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 15:29:27,118 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [166256172] [2025-01-09 15:29:27,118 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [166256172] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 15:29:27,118 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1444533032] [2025-01-09 15:29:27,118 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:29:27,118 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2025-01-09 15:29:27,119 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 [2025-01-09 15:29:27,120 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2025-01-09 15:29:27,121 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (6)] Waiting until timeout for monitored process [2025-01-09 15:29:27,326 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 151 statements into 1 equivalence classes. [2025-01-09 15:29:28,211 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 151 of 151 statements. [2025-01-09 15:29:28,211 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:29:28,211 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:29:28,221 INFO L256 TraceCheckSpWp]: Trace formula consists of 325 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-01-09 15:29:28,228 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 15:29:28,564 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 8 [2025-01-09 15:29:29,366 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 17 [2025-01-09 15:29:29,613 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 25 [2025-01-09 15:29:29,933 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 15:29:29,934 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 31 [2025-01-09 15:29:30,308 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 15:29:30,309 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 37 treesize of output 42 [2025-01-09 15:29:31,721 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 15:29:31,721 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 52 treesize of output 60 [2025-01-09 15:29:32,177 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 15:29:32,177 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 65 treesize of output 41 [2025-01-09 15:29:32,185 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 25 treesize of output 17 [2025-01-09 15:29:32,578 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 543 proven. 33 refuted. 0 times theorem prover too weak. 108 trivial. 0 not checked. [2025-01-09 15:29:32,579 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 15:29:33,064 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 20 [2025-01-09 15:29:33,354 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1444533032] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 15:29:33,354 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-09 15:29:33,354 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 16] total 28 [2025-01-09 15:29:33,354 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [846579000] [2025-01-09 15:29:33,354 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-09 15:29:33,355 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2025-01-09 15:29:33,355 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 15:29:33,356 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2025-01-09 15:29:33,357 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=278, Invalid=844, Unknown=0, NotChecked=0, Total=1122 [2025-01-09 15:29:33,357 INFO L87 Difference]: Start difference. First operand 117 states and 157 transitions. Second operand has 28 states, 24 states have (on average 5.375) internal successors, (129), 26 states have internal predecessors, (129), 12 states have call successors, (38), 10 states have call predecessors, (38), 12 states have return successors, (38), 10 states have call predecessors, (38), 12 states have call successors, (38) [2025-01-09 15:29:38,854 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.27s for a HTC check with result VALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-01-09 15:29:48,680 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.57s for a HTC check with result VALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-01-09 15:29:50,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:29:50,031 INFO L93 Difference]: Finished difference Result 251 states and 327 transitions. [2025-01-09 15:29:50,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2025-01-09 15:29:50,042 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 24 states have (on average 5.375) internal successors, (129), 26 states have internal predecessors, (129), 12 states have call successors, (38), 10 states have call predecessors, (38), 12 states have return successors, (38), 10 states have call predecessors, (38), 12 states have call successors, (38) Word has length 151 [2025-01-09 15:29:50,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:29:50,044 INFO L225 Difference]: With dead ends: 251 [2025-01-09 15:29:50,044 INFO L226 Difference]: Without dead ends: 137 [2025-01-09 15:29:50,046 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 381 GetRequests, 333 SyntacticMatches, 3 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 706 ImplicationChecksByTransitivity, 6.9s TimeCoverageRelationStatistics Valid=561, Invalid=1601, Unknown=0, NotChecked=0, Total=2162 [2025-01-09 15:29:50,046 INFO L435 NwaCegarLoop]: 87 mSDtfsCounter, 342 mSDsluCounter, 850 mSDsCounter, 0 mSdLazyCounter, 969 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 13.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 350 SdHoareTripleChecker+Valid, 937 SdHoareTripleChecker+Invalid, 1024 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 969 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 14.1s IncrementalHoareTripleChecker+Time [2025-01-09 15:29:50,048 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [350 Valid, 937 Invalid, 1024 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 969 Invalid, 0 Unknown, 0 Unchecked, 14.1s Time] [2025-01-09 15:29:50,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2025-01-09 15:29:50,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 133. [2025-01-09 15:29:50,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 106 states have (on average 1.2264150943396226) internal successors, (130), 106 states have internal predecessors, (130), 19 states have call successors, (19), 7 states have call predecessors, (19), 7 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2025-01-09 15:29:50,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 168 transitions. [2025-01-09 15:29:50,073 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 168 transitions. Word has length 151 [2025-01-09 15:29:50,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:29:50,073 INFO L471 AbstractCegarLoop]: Abstraction has 133 states and 168 transitions. [2025-01-09 15:29:50,074 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 24 states have (on average 5.375) internal successors, (129), 26 states have internal predecessors, (129), 12 states have call successors, (38), 10 states have call predecessors, (38), 12 states have return successors, (38), 10 states have call predecessors, (38), 12 states have call successors, (38) [2025-01-09 15:29:50,074 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 168 transitions. [2025-01-09 15:29:50,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2025-01-09 15:29:50,075 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:29:50,076 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:29:50,091 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (6)] Ended with exit code 0 [2025-01-09 15:29:50,287 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-01-09 15:29:50,476 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,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-01-09 15:29:50,477 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:29:50,477 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:29:50,477 INFO L85 PathProgramCache]: Analyzing trace with hash 1497724848, now seen corresponding path program 1 times [2025-01-09 15:29:50,477 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 15:29:50,477 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [184239185] [2025-01-09 15:29:50,478 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:29:50,478 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-01-09 15:29:50,478 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 15:29:50,479 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-01-09 15:29:50,480 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-01-09 15:29:50,582 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 153 statements into 1 equivalence classes. [2025-01-09 15:29:50,739 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 153 of 153 statements. [2025-01-09 15:29:50,739 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:29:50,739 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:29:50,748 INFO L256 TraceCheckSpWp]: Trace formula consists of 328 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-01-09 15:29:50,752 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 15:29:51,793 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 23 [2025-01-09 15:29:51,895 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 15:29:51,896 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 14 [2025-01-09 15:29:51,950 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 204 proven. 45 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked. [2025-01-09 15:29:51,950 INFO L312 TraceCheckSpWp]: Computing backward predicates...