./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-57.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-p_file-57.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 3d3457578c17fc1bdee00c1562f84acead0e6ee0268003a332891d4353885ff1 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 15:48:32,951 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 15:48:33,018 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:48:33,022 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 15:48:33,023 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 15:48:33,041 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 15:48:33,042 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 15:48:33,042 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 15:48:33,043 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 15:48:33,043 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 15:48:33,043 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 15:48:33,043 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 15:48:33,044 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 15:48:33,044 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 15:48:33,044 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 15:48:33,044 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 15:48:33,044 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 15:48:33,044 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 15:48:33,044 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 15:48:33,045 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 15:48:33,045 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 15:48:33,045 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 15:48:33,045 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 15:48:33,045 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 15:48:33,045 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 15:48:33,045 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 15:48:33,045 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 15:48:33,045 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 15:48:33,046 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 15:48:33,046 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 15:48:33,046 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 15:48:33,046 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 15:48:33,046 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 15:48:33,046 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 15:48:33,046 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 15:48:33,046 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 15:48:33,047 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 15:48:33,047 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 15:48:33,047 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 15:48:33,047 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 15:48:33,047 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 15:48:33,047 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 15:48:33,047 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 15:48:33,047 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 15:48:33,047 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 15:48:33,048 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 15:48:33,048 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 15:48:33,048 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 15:48:33,048 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 -> 3d3457578c17fc1bdee00c1562f84acead0e6ee0268003a332891d4353885ff1 [2025-01-09 15:48:33,312 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 15:48:33,321 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 15:48:33,325 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 15:48:33,327 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 15:48:33,327 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 15:48:33,328 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-p_file-57.i [2025-01-09 15:48:34,619 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/2db496395/7c2fd3987b5f49358d3ab2086482a2d1/FLAG584e5adbf [2025-01-09 15:48:34,961 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 15:48:34,961 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-57.i [2025-01-09 15:48:34,972 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/2db496395/7c2fd3987b5f49358d3ab2086482a2d1/FLAG584e5adbf [2025-01-09 15:48:34,990 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/2db496395/7c2fd3987b5f49358d3ab2086482a2d1 [2025-01-09 15:48:34,993 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 15:48:34,995 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 15:48:34,998 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 15:48:34,999 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 15:48:35,003 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 15:48:35,004 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 03:48:34" (1/1) ... [2025-01-09 15:48:35,005 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5915297f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:48:35, skipping insertion in model container [2025-01-09 15:48:35,006 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 03:48:34" (1/1) ... [2025-01-09 15:48:35,024 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 15:48:35,155 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-p_file-57.i[916,929] [2025-01-09 15:48:35,218 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 15:48:35,235 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 15:48:35,246 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-p_file-57.i[916,929] [2025-01-09 15:48:35,287 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 15:48:35,311 INFO L204 MainTranslator]: Completed translation [2025-01-09 15:48:35,312 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:48:35 WrapperNode [2025-01-09 15:48:35,313 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 15:48:35,314 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 15:48:35,315 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 15:48:35,315 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 15:48:35,321 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:48:35" (1/1) ... [2025-01-09 15:48:35,330 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:48:35" (1/1) ... [2025-01-09 15:48:35,370 INFO L138 Inliner]: procedures = 29, calls = 152, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 446 [2025-01-09 15:48:35,374 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 15:48:35,375 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 15:48:35,375 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 15:48:35,375 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 15:48:35,384 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:48:35" (1/1) ... [2025-01-09 15:48:35,385 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:48:35" (1/1) ... [2025-01-09 15:48:35,389 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:48:35" (1/1) ... [2025-01-09 15:48:35,424 INFO L175 MemorySlicer]: Split 110 memory accesses to 14 slices as follows [2, 9, 8, 8, 8, 6, 12, 12, 8, 12, 8, 6, 8, 3]. 11 percent of accesses are in the largest equivalence class. The 15 initializations are split as follows [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]. The 17 writes are split as follows [0, 3, 1, 1, 1, 2, 1, 1, 1, 1, 2, 1, 1, 1]. [2025-01-09 15:48:35,424 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:48:35" (1/1) ... [2025-01-09 15:48:35,424 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:48:35" (1/1) ... [2025-01-09 15:48:35,445 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:48:35" (1/1) ... [2025-01-09 15:48:35,449 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:48:35" (1/1) ... [2025-01-09 15:48:35,453 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:48:35" (1/1) ... [2025-01-09 15:48:35,456 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:48:35" (1/1) ... [2025-01-09 15:48:35,458 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:48:35" (1/1) ... [2025-01-09 15:48:35,463 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 15:48:35,464 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 15:48:35,464 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 15:48:35,464 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 15:48:35,465 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:48:35" (1/1) ... [2025-01-09 15:48:35,469 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 15:48:35,490 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 15:48:35,510 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:48:35,514 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:48:35,539 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 15:48:35,539 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#0 [2025-01-09 15:48:35,539 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#1 [2025-01-09 15:48:35,540 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#2 [2025-01-09 15:48:35,540 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#3 [2025-01-09 15:48:35,540 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#4 [2025-01-09 15:48:35,540 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#5 [2025-01-09 15:48:35,540 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#6 [2025-01-09 15:48:35,540 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#7 [2025-01-09 15:48:35,540 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#8 [2025-01-09 15:48:35,540 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#9 [2025-01-09 15:48:35,540 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#10 [2025-01-09 15:48:35,540 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#11 [2025-01-09 15:48:35,541 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#12 [2025-01-09 15:48:35,541 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#13 [2025-01-09 15:48:35,541 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-01-09 15:48:35,541 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-01-09 15:48:35,541 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-01-09 15:48:35,541 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-01-09 15:48:35,542 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-01-09 15:48:35,542 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2025-01-09 15:48:35,542 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2025-01-09 15:48:35,542 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#7 [2025-01-09 15:48:35,542 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#8 [2025-01-09 15:48:35,542 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#9 [2025-01-09 15:48:35,542 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#10 [2025-01-09 15:48:35,544 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#11 [2025-01-09 15:48:35,544 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#12 [2025-01-09 15:48:35,544 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#13 [2025-01-09 15:48:35,544 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2025-01-09 15:48:35,544 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2025-01-09 15:48:35,544 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#2 [2025-01-09 15:48:35,544 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#3 [2025-01-09 15:48:35,544 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#4 [2025-01-09 15:48:35,544 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#5 [2025-01-09 15:48:35,544 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#6 [2025-01-09 15:48:35,544 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#7 [2025-01-09 15:48:35,545 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#8 [2025-01-09 15:48:35,545 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#9 [2025-01-09 15:48:35,545 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#10 [2025-01-09 15:48:35,545 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#11 [2025-01-09 15:48:35,545 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#12 [2025-01-09 15:48:35,545 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#13 [2025-01-09 15:48:35,545 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-01-09 15:48:35,545 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-01-09 15:48:35,545 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-01-09 15:48:35,545 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-01-09 15:48:35,545 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-01-09 15:48:35,545 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2025-01-09 15:48:35,545 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2025-01-09 15:48:35,546 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#7 [2025-01-09 15:48:35,546 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#8 [2025-01-09 15:48:35,548 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#9 [2025-01-09 15:48:35,548 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#10 [2025-01-09 15:48:35,548 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#11 [2025-01-09 15:48:35,548 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#12 [2025-01-09 15:48:35,548 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#13 [2025-01-09 15:48:35,548 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#0 [2025-01-09 15:48:35,548 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#1 [2025-01-09 15:48:35,548 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#2 [2025-01-09 15:48:35,548 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#3 [2025-01-09 15:48:35,549 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#4 [2025-01-09 15:48:35,549 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#5 [2025-01-09 15:48:35,549 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#6 [2025-01-09 15:48:35,549 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#7 [2025-01-09 15:48:35,549 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#8 [2025-01-09 15:48:35,549 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#9 [2025-01-09 15:48:35,549 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#10 [2025-01-09 15:48:35,549 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#11 [2025-01-09 15:48:35,549 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#12 [2025-01-09 15:48:35,549 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#13 [2025-01-09 15:48:35,549 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 15:48:35,549 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 15:48:35,549 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 15:48:35,549 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-01-09 15:48:35,549 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-01-09 15:48:35,549 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-01-09 15:48:35,549 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-01-09 15:48:35,549 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-01-09 15:48:35,549 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2025-01-09 15:48:35,549 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2025-01-09 15:48:35,550 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2025-01-09 15:48:35,550 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2025-01-09 15:48:35,550 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#10 [2025-01-09 15:48:35,550 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#11 [2025-01-09 15:48:35,550 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#12 [2025-01-09 15:48:35,550 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#13 [2025-01-09 15:48:35,550 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 15:48:35,550 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 15:48:35,745 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 15:48:35,747 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 15:48:36,269 INFO L? ?]: Removed 94 outVars from TransFormulas that were not future-live. [2025-01-09 15:48:36,269 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 15:48:36,281 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 15:48:36,281 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 15:48:36,281 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 03:48:36 BoogieIcfgContainer [2025-01-09 15:48:36,282 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 15:48:36,284 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 15:48:36,284 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 15:48:36,288 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 15:48:36,288 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 03:48:34" (1/3) ... [2025-01-09 15:48:36,289 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@40f73d49 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 03:48:36, skipping insertion in model container [2025-01-09 15:48:36,289 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:48:35" (2/3) ... [2025-01-09 15:48:36,289 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@40f73d49 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 03:48:36, skipping insertion in model container [2025-01-09 15:48:36,289 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 03:48:36" (3/3) ... [2025-01-09 15:48:36,291 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-p_file-57.i [2025-01-09 15:48:36,303 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 15:48:36,304 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-p_file-57.i that has 2 procedures, 96 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 15:48:36,356 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 15:48:36,366 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;@7aec544e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 15:48:36,367 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 15:48:36,371 INFO L276 IsEmpty]: Start isEmpty. Operand has 96 states, 75 states have (on average 1.3866666666666667) internal successors, (104), 76 states have internal predecessors, (104), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-01-09 15:48:36,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2025-01-09 15:48:36,380 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:48:36,381 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:48:36,381 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:48:36,388 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:48:36,388 INFO L85 PathProgramCache]: Analyzing trace with hash -827950772, now seen corresponding path program 1 times [2025-01-09 15:48:36,395 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:48:36,398 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1463727427] [2025-01-09 15:48:36,398 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:48:36,399 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:48:36,527 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 134 statements into 1 equivalence classes. [2025-01-09 15:48:36,574 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 134 of 134 statements. [2025-01-09 15:48:36,575 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:48:36,575 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:48:36,790 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 578 trivial. 0 not checked. [2025-01-09 15:48:36,791 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:48:36,792 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1463727427] [2025-01-09 15:48:36,793 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1463727427] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 15:48:36,793 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1874044913] [2025-01-09 15:48:36,793 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:48:36,794 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 15:48:36,794 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 15:48:36,798 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:48:36,800 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:48:36,993 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 134 statements into 1 equivalence classes. [2025-01-09 15:48:37,108 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 134 of 134 statements. [2025-01-09 15:48:37,108 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:48:37,108 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:48:37,113 INFO L256 TraceCheckSpWp]: Trace formula consists of 587 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 15:48:37,123 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 15:48:37,148 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 578 trivial. 0 not checked. [2025-01-09 15:48:37,150 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 15:48:37,151 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1874044913] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:48:37,151 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 15:48:37,151 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-01-09 15:48:37,154 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1598783291] [2025-01-09 15:48:37,154 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:48:37,159 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 15:48:37,161 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:48:37,181 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 15:48:37,181 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 15:48:37,184 INFO L87 Difference]: Start difference. First operand has 96 states, 75 states have (on average 1.3866666666666667) internal successors, (104), 76 states have internal predecessors, (104), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) Second operand has 2 states, 2 states have (on average 24.5) internal successors, (49), 2 states have internal predecessors, (49), 2 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2025-01-09 15:48:37,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:48:37,207 INFO L93 Difference]: Finished difference Result 186 states and 293 transitions. [2025-01-09 15:48:37,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 15:48:37,208 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 24.5) internal successors, (49), 2 states have internal predecessors, (49), 2 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) Word has length 134 [2025-01-09 15:48:37,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:48:37,214 INFO L225 Difference]: With dead ends: 186 [2025-01-09 15:48:37,214 INFO L226 Difference]: Without dead ends: 93 [2025-01-09 15:48:37,217 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 135 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:48:37,220 INFO L435 NwaCegarLoop]: 135 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, 135 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:48:37,221 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 135 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 15:48:37,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2025-01-09 15:48:37,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2025-01-09 15:48:37,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 73 states have (on average 1.356164383561644) internal successors, (99), 73 states have internal predecessors, (99), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-01-09 15:48:37,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 135 transitions. [2025-01-09 15:48:37,260 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 135 transitions. Word has length 134 [2025-01-09 15:48:37,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:48:37,261 INFO L471 AbstractCegarLoop]: Abstraction has 93 states and 135 transitions. [2025-01-09 15:48:37,261 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 24.5) internal successors, (49), 2 states have internal predecessors, (49), 2 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2025-01-09 15:48:37,261 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 135 transitions. [2025-01-09 15:48:37,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2025-01-09 15:48:37,264 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:48:37,264 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:48:37,271 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:48:37,464 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:48:37,465 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:48:37,465 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:48:37,465 INFO L85 PathProgramCache]: Analyzing trace with hash 669687792, now seen corresponding path program 1 times [2025-01-09 15:48:37,466 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:48:37,466 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [693721032] [2025-01-09 15:48:37,466 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:48:37,466 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:48:37,493 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 134 statements into 1 equivalence classes. [2025-01-09 15:48:37,547 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 134 of 134 statements. [2025-01-09 15:48:37,548 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:48:37,548 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:48:37,853 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-01-09 15:48:37,855 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:48:37,855 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [693721032] [2025-01-09 15:48:37,855 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [693721032] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:48:37,855 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:48:37,855 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 15:48:37,855 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [47642471] [2025-01-09 15:48:37,855 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:48:37,856 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 15:48:37,856 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:48:37,858 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 15:48:37,858 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 15:48:37,858 INFO L87 Difference]: Start difference. First operand 93 states and 135 transitions. Second operand has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-01-09 15:48:37,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:48:37,908 INFO L93 Difference]: Finished difference Result 186 states and 271 transitions. [2025-01-09 15:48:37,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 15:48:37,909 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 134 [2025-01-09 15:48:37,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:48:37,912 INFO L225 Difference]: With dead ends: 186 [2025-01-09 15:48:37,913 INFO L226 Difference]: Without dead ends: 96 [2025-01-09 15:48:37,914 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:48:37,915 INFO L435 NwaCegarLoop]: 132 mSDtfsCounter, 1 mSDsluCounter, 255 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 387 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:48:37,916 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 387 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 15:48:37,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2025-01-09 15:48:37,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 95. [2025-01-09 15:48:37,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 75 states have (on average 1.3466666666666667) internal successors, (101), 75 states have internal predecessors, (101), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-01-09 15:48:37,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 137 transitions. [2025-01-09 15:48:37,932 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 137 transitions. Word has length 134 [2025-01-09 15:48:37,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:48:37,933 INFO L471 AbstractCegarLoop]: Abstraction has 95 states and 137 transitions. [2025-01-09 15:48:37,933 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-01-09 15:48:37,933 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 137 transitions. [2025-01-09 15:48:37,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2025-01-09 15:48:37,936 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:48:37,936 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:48:37,936 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 15:48:37,936 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:48:37,937 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:48:37,937 INFO L85 PathProgramCache]: Analyzing trace with hash 671534834, now seen corresponding path program 1 times [2025-01-09 15:48:37,937 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:48:37,937 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1688603163] [2025-01-09 15:48:37,937 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:48:37,937 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:48:37,987 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 134 statements into 1 equivalence classes. [2025-01-09 15:48:38,028 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 134 of 134 statements. [2025-01-09 15:48:38,028 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:48:38,028 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:48:38,461 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-01-09 15:48:38,461 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:48:38,461 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1688603163] [2025-01-09 15:48:38,461 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1688603163] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:48:38,461 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:48:38,461 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 15:48:38,461 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2060979437] [2025-01-09 15:48:38,461 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:48:38,462 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 15:48:38,462 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:48:38,462 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 15:48:38,462 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 15:48:38,463 INFO L87 Difference]: Start difference. First operand 95 states and 137 transitions. Second operand has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-01-09 15:48:38,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:48:38,574 INFO L93 Difference]: Finished difference Result 236 states and 343 transitions. [2025-01-09 15:48:38,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 15:48:38,577 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 134 [2025-01-09 15:48:38,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:48:38,579 INFO L225 Difference]: With dead ends: 236 [2025-01-09 15:48:38,579 INFO L226 Difference]: Without dead ends: 144 [2025-01-09 15:48:38,580 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-01-09 15:48:38,580 INFO L435 NwaCegarLoop]: 149 mSDtfsCounter, 60 mSDsluCounter, 405 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 554 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 15:48:38,583 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 554 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 15:48:38,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2025-01-09 15:48:38,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 111. [2025-01-09 15:48:38,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 91 states have (on average 1.3736263736263736) internal successors, (125), 91 states have internal predecessors, (125), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-01-09 15:48:38,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 161 transitions. [2025-01-09 15:48:38,598 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 161 transitions. Word has length 134 [2025-01-09 15:48:38,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:48:38,599 INFO L471 AbstractCegarLoop]: Abstraction has 111 states and 161 transitions. [2025-01-09 15:48:38,600 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-01-09 15:48:38,600 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 161 transitions. [2025-01-09 15:48:38,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2025-01-09 15:48:38,603 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:48:38,604 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:48:38,605 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 15:48:38,606 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:48:38,606 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:48:38,606 INFO L85 PathProgramCache]: Analyzing trace with hash 362629820, now seen corresponding path program 1 times [2025-01-09 15:48:38,606 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:48:38,606 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [373354042] [2025-01-09 15:48:38,606 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:48:38,606 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:48:38,637 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 136 statements into 1 equivalence classes. [2025-01-09 15:48:38,658 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 136 of 136 statements. [2025-01-09 15:48:38,658 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:48:38,658 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:48:38,727 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-01-09 15:48:38,728 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:48:38,728 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [373354042] [2025-01-09 15:48:38,728 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [373354042] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:48:38,728 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:48:38,728 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 15:48:38,728 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1405714377] [2025-01-09 15:48:38,728 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:48:38,729 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 15:48:38,729 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:48:38,729 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 15:48:38,729 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 15:48:38,730 INFO L87 Difference]: Start difference. First operand 111 states and 161 transitions. Second operand has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-01-09 15:48:38,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:48:38,759 INFO L93 Difference]: Finished difference Result 259 states and 377 transitions. [2025-01-09 15:48:38,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 15:48:38,761 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 136 [2025-01-09 15:48:38,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:48:38,762 INFO L225 Difference]: With dead ends: 259 [2025-01-09 15:48:38,762 INFO L226 Difference]: Without dead ends: 151 [2025-01-09 15:48:38,763 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 15:48:38,763 INFO L435 NwaCegarLoop]: 186 mSDtfsCounter, 60 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 300 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 15:48:38,764 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 300 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 15:48:38,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2025-01-09 15:48:38,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 111. [2025-01-09 15:48:38,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 91 states have (on average 1.3626373626373627) internal successors, (124), 91 states have internal predecessors, (124), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-01-09 15:48:38,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 160 transitions. [2025-01-09 15:48:38,790 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 160 transitions. Word has length 136 [2025-01-09 15:48:38,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:48:38,791 INFO L471 AbstractCegarLoop]: Abstraction has 111 states and 160 transitions. [2025-01-09 15:48:38,791 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-01-09 15:48:38,791 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 160 transitions. [2025-01-09 15:48:38,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2025-01-09 15:48:38,796 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:48:38,796 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:48:38,796 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 15:48:38,796 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:48:38,797 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:48:38,797 INFO L85 PathProgramCache]: Analyzing trace with hash -1418117742, now seen corresponding path program 1 times [2025-01-09 15:48:38,797 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:48:38,797 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [475883630] [2025-01-09 15:48:38,798 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:48:38,798 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:48:38,828 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 137 statements into 1 equivalence classes. [2025-01-09 15:48:38,862 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 137 of 137 statements. [2025-01-09 15:48:38,864 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:48:38,864 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:48:39,139 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-01-09 15:48:39,140 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:48:39,140 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [475883630] [2025-01-09 15:48:39,140 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [475883630] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:48:39,140 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:48:39,140 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 15:48:39,140 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1389170113] [2025-01-09 15:48:39,140 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:48:39,142 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 15:48:39,142 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:48:39,142 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 15:48:39,143 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 15:48:39,143 INFO L87 Difference]: Start difference. First operand 111 states and 160 transitions. Second operand has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-01-09 15:48:39,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:48:39,335 INFO L93 Difference]: Finished difference Result 312 states and 451 transitions. [2025-01-09 15:48:39,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 15:48:39,337 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 137 [2025-01-09 15:48:39,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:48:39,338 INFO L225 Difference]: With dead ends: 312 [2025-01-09 15:48:39,338 INFO L226 Difference]: Without dead ends: 204 [2025-01-09 15:48:39,339 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 15:48:39,341 INFO L435 NwaCegarLoop]: 126 mSDtfsCounter, 111 mSDsluCounter, 241 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 367 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 15:48:39,341 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 367 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 15:48:39,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2025-01-09 15:48:39,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 155. [2025-01-09 15:48:39,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 155 states, 116 states have (on average 1.2844827586206897) internal successors, (149), 116 states have internal predecessors, (149), 36 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2025-01-09 15:48:39,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 221 transitions. [2025-01-09 15:48:39,373 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 221 transitions. Word has length 137 [2025-01-09 15:48:39,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:48:39,376 INFO L471 AbstractCegarLoop]: Abstraction has 155 states and 221 transitions. [2025-01-09 15:48:39,377 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-01-09 15:48:39,377 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 221 transitions. [2025-01-09 15:48:39,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2025-01-09 15:48:39,378 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:48:39,378 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:48:39,379 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 15:48:39,379 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:48:39,379 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:48:39,379 INFO L85 PathProgramCache]: Analyzing trace with hash 1026430481, now seen corresponding path program 1 times [2025-01-09 15:48:39,380 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:48:39,380 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [72658137] [2025-01-09 15:48:39,380 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:48:39,380 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:48:39,418 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 141 statements into 1 equivalence classes. [2025-01-09 15:48:39,441 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 141 of 141 statements. [2025-01-09 15:48:39,441 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:48:39,442 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:48:39,854 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-01-09 15:48:39,854 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:48:39,854 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [72658137] [2025-01-09 15:48:39,854 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [72658137] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:48:39,854 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:48:39,854 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 15:48:39,854 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1304231273] [2025-01-09 15:48:39,854 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:48:39,855 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 15:48:39,855 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:48:39,855 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 15:48:39,855 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 15:48:39,856 INFO L87 Difference]: Start difference. First operand 155 states and 221 transitions. Second operand has 6 states, 6 states have (on average 9.0) internal successors, (54), 6 states have internal predecessors, (54), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-01-09 15:48:39,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:48:39,979 INFO L93 Difference]: Finished difference Result 313 states and 450 transitions. [2025-01-09 15:48:39,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 15:48:39,979 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.0) internal successors, (54), 6 states have internal predecessors, (54), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 141 [2025-01-09 15:48:39,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:48:39,982 INFO L225 Difference]: With dead ends: 313 [2025-01-09 15:48:39,983 INFO L226 Difference]: Without dead ends: 205 [2025-01-09 15:48:39,985 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-01-09 15:48:39,986 INFO L435 NwaCegarLoop]: 128 mSDtfsCounter, 56 mSDsluCounter, 494 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 622 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 15:48:39,986 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 622 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 15:48:39,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2025-01-09 15:48:40,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 174. [2025-01-09 15:48:40,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 174 states, 135 states have (on average 1.3185185185185184) internal successors, (178), 135 states have internal predecessors, (178), 36 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2025-01-09 15:48:40,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 250 transitions. [2025-01-09 15:48:40,011 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 250 transitions. Word has length 141 [2025-01-09 15:48:40,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:48:40,013 INFO L471 AbstractCegarLoop]: Abstraction has 174 states and 250 transitions. [2025-01-09 15:48:40,013 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.0) internal successors, (54), 6 states have internal predecessors, (54), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-01-09 15:48:40,013 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 250 transitions. [2025-01-09 15:48:40,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2025-01-09 15:48:40,015 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:48:40,015 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:48:40,015 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 15:48:40,015 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:48:40,016 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:48:40,016 INFO L85 PathProgramCache]: Analyzing trace with hash 1284595919, now seen corresponding path program 1 times [2025-01-09 15:48:40,016 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:48:40,016 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [531982491] [2025-01-09 15:48:40,016 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:48:40,016 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:48:40,040 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 141 statements into 1 equivalence classes. [2025-01-09 15:48:40,056 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 141 of 141 statements. [2025-01-09 15:48:40,057 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:48:40,057 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:48:40,393 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-01-09 15:48:40,394 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:48:40,394 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [531982491] [2025-01-09 15:48:40,394 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [531982491] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:48:40,394 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:48:40,394 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 15:48:40,394 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [612105315] [2025-01-09 15:48:40,394 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:48:40,394 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 15:48:40,394 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:48:40,395 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 15:48:40,395 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-01-09 15:48:40,395 INFO L87 Difference]: Start difference. First operand 174 states and 250 transitions. Second operand has 7 states, 7 states have (on average 7.714285714285714) internal successors, (54), 7 states have internal predecessors, (54), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-01-09 15:48:40,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:48:40,539 INFO L93 Difference]: Finished difference Result 329 states and 474 transitions. [2025-01-09 15:48:40,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-09 15:48:40,539 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.714285714285714) internal successors, (54), 7 states have internal predecessors, (54), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 141 [2025-01-09 15:48:40,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:48:40,541 INFO L225 Difference]: With dead ends: 329 [2025-01-09 15:48:40,541 INFO L226 Difference]: Without dead ends: 202 [2025-01-09 15:48:40,542 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2025-01-09 15:48:40,543 INFO L435 NwaCegarLoop]: 124 mSDtfsCounter, 169 mSDsluCounter, 534 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 169 SdHoareTripleChecker+Valid, 658 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 15:48:40,543 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [169 Valid, 658 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 15:48:40,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2025-01-09 15:48:40,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 153. [2025-01-09 15:48:40,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 153 states, 114 states have (on average 1.280701754385965) internal successors, (146), 114 states have internal predecessors, (146), 36 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2025-01-09 15:48:40,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 218 transitions. [2025-01-09 15:48:40,558 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 218 transitions. Word has length 141 [2025-01-09 15:48:40,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:48:40,558 INFO L471 AbstractCegarLoop]: Abstraction has 153 states and 218 transitions. [2025-01-09 15:48:40,558 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.714285714285714) internal successors, (54), 7 states have internal predecessors, (54), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-01-09 15:48:40,559 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 218 transitions. [2025-01-09 15:48:40,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2025-01-09 15:48:40,560 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:48:40,560 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:48:40,560 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 15:48:40,560 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:48:40,561 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:48:40,561 INFO L85 PathProgramCache]: Analyzing trace with hash 1363586579, now seen corresponding path program 1 times [2025-01-09 15:48:40,561 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:48:40,561 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [884541351] [2025-01-09 15:48:40,561 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:48:40,561 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:48:40,585 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 144 statements into 1 equivalence classes. [2025-01-09 15:48:40,641 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 144 of 144 statements. [2025-01-09 15:48:40,641 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:48:40,641 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:48:41,033 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-01-09 15:48:41,034 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:48:41,034 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [884541351] [2025-01-09 15:48:41,034 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [884541351] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:48:41,034 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:48:41,034 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 15:48:41,034 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [378463116] [2025-01-09 15:48:41,034 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:48:41,034 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 15:48:41,034 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:48:41,035 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 15:48:41,035 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-09 15:48:41,035 INFO L87 Difference]: Start difference. First operand 153 states and 218 transitions. Second operand has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-01-09 15:48:41,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:48:41,098 INFO L93 Difference]: Finished difference Result 308 states and 442 transitions. [2025-01-09 15:48:41,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 15:48:41,099 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 144 [2025-01-09 15:48:41,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:48:41,100 INFO L225 Difference]: With dead ends: 308 [2025-01-09 15:48:41,100 INFO L226 Difference]: Without dead ends: 202 [2025-01-09 15:48:41,101 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-01-09 15:48:41,101 INFO L435 NwaCegarLoop]: 127 mSDtfsCounter, 60 mSDsluCounter, 362 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 489 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 15:48:41,101 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 489 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 15:48:41,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2025-01-09 15:48:41,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 169. [2025-01-09 15:48:41,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 169 states, 130 states have (on average 1.3076923076923077) internal successors, (170), 130 states have internal predecessors, (170), 36 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2025-01-09 15:48:41,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 242 transitions. [2025-01-09 15:48:41,117 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 242 transitions. Word has length 144 [2025-01-09 15:48:41,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:48:41,118 INFO L471 AbstractCegarLoop]: Abstraction has 169 states and 242 transitions. [2025-01-09 15:48:41,118 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-01-09 15:48:41,118 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 242 transitions. [2025-01-09 15:48:41,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2025-01-09 15:48:41,119 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:48:41,119 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:48:41,119 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 15:48:41,120 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:48:41,120 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:48:41,120 INFO L85 PathProgramCache]: Analyzing trace with hash -630558127, now seen corresponding path program 1 times [2025-01-09 15:48:41,120 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:48:41,120 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2015821741] [2025-01-09 15:48:41,120 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:48:41,120 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:48:41,154 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 144 statements into 1 equivalence classes. [2025-01-09 15:48:41,299 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 144 of 144 statements. [2025-01-09 15:48:41,299 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:48:41,299 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:48:44,386 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 117 proven. 18 refuted. 0 times theorem prover too weak. 477 trivial. 0 not checked. [2025-01-09 15:48:44,387 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:48:44,387 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2015821741] [2025-01-09 15:48:44,388 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2015821741] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 15:48:44,388 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1215422400] [2025-01-09 15:48:44,388 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:48:44,388 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 15:48:44,389 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 15:48:44,391 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:48:44,394 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:48:44,571 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 144 statements into 1 equivalence classes. [2025-01-09 15:48:44,690 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 144 of 144 statements. [2025-01-09 15:48:44,690 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:48:44,690 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:48:44,700 INFO L256 TraceCheckSpWp]: Trace formula consists of 626 conjuncts, 80 conjuncts are in the unsatisfiable core [2025-01-09 15:48:44,717 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 15:48:46,315 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:48:46,693 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:48:47,199 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:48:47,565 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:48:47,925 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-01-09 15:48:47,932 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-01-09 15:48:48,201 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:48:48,412 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 94 treesize of output 70 [2025-01-09 15:48:48,441 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 162 treesize of output 114 [2025-01-09 15:48:48,449 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 35 [2025-01-09 15:48:48,569 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 8 proven. 451 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked. [2025-01-09 15:48:48,569 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 15:48:49,041 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-01-09 15:48:49,042 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1215422400] provided 1 perfect and 1 imperfect interpolant sequences [2025-01-09 15:48:49,042 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-01-09 15:48:49,042 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [26, 33] total 54 [2025-01-09 15:48:49,042 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [208488487] [2025-01-09 15:48:49,042 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:48:49,043 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 15:48:49,043 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:48:49,043 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 15:48:49,045 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=179, Invalid=2683, Unknown=0, NotChecked=0, Total=2862 [2025-01-09 15:48:49,045 INFO L87 Difference]: Start difference. First operand 169 states and 242 transitions. Second operand has 6 states, 6 states have (on average 9.5) internal successors, (57), 6 states have internal predecessors, (57), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-01-09 15:48:49,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:48:49,295 INFO L93 Difference]: Finished difference Result 359 states and 512 transitions. [2025-01-09 15:48:49,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 15:48:49,296 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.5) internal successors, (57), 6 states have internal predecessors, (57), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 144 [2025-01-09 15:48:49,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:48:49,298 INFO L225 Difference]: With dead ends: 359 [2025-01-09 15:48:49,298 INFO L226 Difference]: Without dead ends: 237 [2025-01-09 15:48:49,300 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 319 GetRequests, 264 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 705 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=191, Invalid=3001, Unknown=0, NotChecked=0, Total=3192 [2025-01-09 15:48:49,301 INFO L435 NwaCegarLoop]: 169 mSDtfsCounter, 73 mSDsluCounter, 601 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 770 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 15:48:49,301 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 770 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 15:48:49,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2025-01-09 15:48:49,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 234. [2025-01-09 15:48:49,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 234 states, 184 states have (on average 1.298913043478261) internal successors, (239), 185 states have internal predecessors, (239), 46 states have call successors, (46), 3 states have call predecessors, (46), 3 states have return successors, (46), 45 states have call predecessors, (46), 46 states have call successors, (46) [2025-01-09 15:48:49,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 331 transitions. [2025-01-09 15:48:49,319 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 331 transitions. Word has length 144 [2025-01-09 15:48:49,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:48:49,319 INFO L471 AbstractCegarLoop]: Abstraction has 234 states and 331 transitions. [2025-01-09 15:48:49,319 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.5) internal successors, (57), 6 states have internal predecessors, (57), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-01-09 15:48:49,320 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 331 transitions. [2025-01-09 15:48:49,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2025-01-09 15:48:49,321 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:48:49,321 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:48:49,331 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:48:49,525 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 15:48:49,525 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:48:49,525 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:48:49,525 INFO L85 PathProgramCache]: Analyzing trace with hash -424613025, now seen corresponding path program 1 times [2025-01-09 15:48:49,525 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:48:49,526 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [860567628] [2025-01-09 15:48:49,526 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:48:49,526 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:48:49,546 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 145 statements into 1 equivalence classes. [2025-01-09 15:48:49,575 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 145 of 145 statements. [2025-01-09 15:48:49,575 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:48:49,575 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:48:49,802 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-01-09 15:48:49,802 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:48:49,802 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [860567628] [2025-01-09 15:48:49,803 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [860567628] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:48:49,803 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:48:49,803 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 15:48:49,803 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1070997275] [2025-01-09 15:48:49,803 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:48:49,803 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 15:48:49,803 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:48:49,804 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 15:48:49,805 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-09 15:48:49,805 INFO L87 Difference]: Start difference. First operand 234 states and 331 transitions. Second operand has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-01-09 15:48:49,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:48:49,869 INFO L93 Difference]: Finished difference Result 453 states and 642 transitions. [2025-01-09 15:48:49,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 15:48:49,869 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 145 [2025-01-09 15:48:49,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:48:49,874 INFO L225 Difference]: With dead ends: 453 [2025-01-09 15:48:49,874 INFO L226 Difference]: Without dead ends: 266 [2025-01-09 15:48:49,875 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-01-09 15:48:49,875 INFO L435 NwaCegarLoop]: 136 mSDtfsCounter, 113 mSDsluCounter, 250 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 386 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 15:48:49,877 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 386 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 15:48:49,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2025-01-09 15:48:49,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 230. [2025-01-09 15:48:49,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 230 states, 180 states have (on average 1.288888888888889) internal successors, (232), 181 states have internal predecessors, (232), 46 states have call successors, (46), 3 states have call predecessors, (46), 3 states have return successors, (46), 45 states have call predecessors, (46), 46 states have call successors, (46) [2025-01-09 15:48:49,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 324 transitions. [2025-01-09 15:48:49,904 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 324 transitions. Word has length 145 [2025-01-09 15:48:49,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:48:49,905 INFO L471 AbstractCegarLoop]: Abstraction has 230 states and 324 transitions. [2025-01-09 15:48:49,905 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-01-09 15:48:49,905 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 324 transitions. [2025-01-09 15:48:49,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2025-01-09 15:48:49,907 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:48:49,907 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:48:49,908 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 15:48:49,908 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:48:49,908 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:48:49,908 INFO L85 PathProgramCache]: Analyzing trace with hash 1546899427, now seen corresponding path program 1 times [2025-01-09 15:48:49,908 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:48:49,908 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1182957401] [2025-01-09 15:48:49,908 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:48:49,908 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:48:49,929 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 145 statements into 1 equivalence classes. [2025-01-09 15:48:49,960 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 145 of 145 statements. [2025-01-09 15:48:49,962 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:48:49,962 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:48:50,198 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-01-09 15:48:50,199 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:48:50,199 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1182957401] [2025-01-09 15:48:50,199 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1182957401] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:48:50,199 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:48:50,199 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 15:48:50,199 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [73311913] [2025-01-09 15:48:50,199 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:48:50,200 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 15:48:50,200 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:48:50,200 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 15:48:50,200 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-09 15:48:50,201 INFO L87 Difference]: Start difference. First operand 230 states and 324 transitions. Second operand has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-01-09 15:48:50,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:48:50,267 INFO L93 Difference]: Finished difference Result 484 states and 684 transitions. [2025-01-09 15:48:50,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 15:48:50,268 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 145 [2025-01-09 15:48:50,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:48:50,270 INFO L225 Difference]: With dead ends: 484 [2025-01-09 15:48:50,270 INFO L226 Difference]: Without dead ends: 301 [2025-01-09 15:48:50,270 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-01-09 15:48:50,271 INFO L435 NwaCegarLoop]: 179 mSDtfsCounter, 100 mSDsluCounter, 288 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 467 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 15:48:50,271 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 467 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 15:48:50,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 301 states. [2025-01-09 15:48:50,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 301 to 248. [2025-01-09 15:48:50,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 248 states, 198 states have (on average 1.303030303030303) internal successors, (258), 199 states have internal predecessors, (258), 46 states have call successors, (46), 3 states have call predecessors, (46), 3 states have return successors, (46), 45 states have call predecessors, (46), 46 states have call successors, (46) [2025-01-09 15:48:50,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 350 transitions. [2025-01-09 15:48:50,294 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 350 transitions. Word has length 145 [2025-01-09 15:48:50,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:48:50,295 INFO L471 AbstractCegarLoop]: Abstraction has 248 states and 350 transitions. [2025-01-09 15:48:50,295 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-01-09 15:48:50,295 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 350 transitions. [2025-01-09 15:48:50,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2025-01-09 15:48:50,298 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:48:50,299 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:48:50,299 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 15:48:50,299 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:48:50,301 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:48:50,301 INFO L85 PathProgramCache]: Analyzing trace with hash -2047003291, now seen corresponding path program 1 times [2025-01-09 15:48:50,301 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:48:50,301 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1621519908] [2025-01-09 15:48:50,301 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:48:50,301 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:48:50,324 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 145 statements into 1 equivalence classes. [2025-01-09 15:48:50,350 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 145 of 145 statements. [2025-01-09 15:48:50,350 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:48:50,350 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:48:50,516 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-01-09 15:48:50,516 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:48:50,516 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1621519908] [2025-01-09 15:48:50,516 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1621519908] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:48:50,516 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:48:50,517 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 15:48:50,517 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [165281673] [2025-01-09 15:48:50,517 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:48:50,517 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 15:48:50,517 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:48:50,518 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 15:48:50,519 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 15:48:50,519 INFO L87 Difference]: Start difference. First operand 248 states and 350 transitions. Second operand has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-01-09 15:48:50,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:48:50,607 INFO L93 Difference]: Finished difference Result 584 states and 817 transitions. [2025-01-09 15:48:50,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 15:48:50,608 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 145 [2025-01-09 15:48:50,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:48:50,612 INFO L225 Difference]: With dead ends: 584 [2025-01-09 15:48:50,612 INFO L226 Difference]: Without dead ends: 383 [2025-01-09 15:48:50,614 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-01-09 15:48:50,614 INFO L435 NwaCegarLoop]: 155 mSDtfsCounter, 96 mSDsluCounter, 411 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 566 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 15:48:50,615 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [96 Valid, 566 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 15:48:50,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 383 states. [2025-01-09 15:48:50,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 383 to 379. [2025-01-09 15:48:50,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 379 states, 318 states have (on average 1.3176100628930818) internal successors, (419), 321 states have internal predecessors, (419), 54 states have call successors, (54), 6 states have call predecessors, (54), 6 states have return successors, (54), 51 states have call predecessors, (54), 54 states have call successors, (54) [2025-01-09 15:48:50,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 379 states to 379 states and 527 transitions. [2025-01-09 15:48:50,655 INFO L78 Accepts]: Start accepts. Automaton has 379 states and 527 transitions. Word has length 145 [2025-01-09 15:48:50,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:48:50,656 INFO L471 AbstractCegarLoop]: Abstraction has 379 states and 527 transitions. [2025-01-09 15:48:50,656 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-01-09 15:48:50,656 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 527 transitions. [2025-01-09 15:48:50,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2025-01-09 15:48:50,659 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:48:50,659 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:48:50,659 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-09 15:48:50,659 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:48:50,660 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:48:50,660 INFO L85 PathProgramCache]: Analyzing trace with hash -660799897, now seen corresponding path program 1 times [2025-01-09 15:48:50,660 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:48:50,660 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2016149092] [2025-01-09 15:48:50,660 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:48:50,660 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:48:50,682 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 145 statements into 1 equivalence classes. [2025-01-09 15:48:50,708 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 145 of 145 statements. [2025-01-09 15:48:50,710 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:48:50,710 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:48:50,972 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-01-09 15:48:50,973 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:48:50,973 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2016149092] [2025-01-09 15:48:50,973 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2016149092] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:48:50,973 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:48:50,973 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 15:48:50,973 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1014852036] [2025-01-09 15:48:50,973 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:48:50,974 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 15:48:50,974 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:48:50,975 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 15:48:50,975 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-09 15:48:50,975 INFO L87 Difference]: Start difference. First operand 379 states and 527 transitions. Second operand has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 states have internal predecessors, (58), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-01-09 15:48:51,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:48:51,091 INFO L93 Difference]: Finished difference Result 789 states and 1099 transitions. [2025-01-09 15:48:51,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 15:48:51,092 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 states have internal predecessors, (58), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 145 [2025-01-09 15:48:51,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:48:51,096 INFO L225 Difference]: With dead ends: 789 [2025-01-09 15:48:51,096 INFO L226 Difference]: Without dead ends: 461 [2025-01-09 15:48:51,098 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-01-09 15:48:51,099 INFO L435 NwaCegarLoop]: 216 mSDtfsCounter, 88 mSDsluCounter, 542 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 758 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 15:48:51,100 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [88 Valid, 758 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 15:48:51,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 461 states. [2025-01-09 15:48:51,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 461 to 372. [2025-01-09 15:48:51,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 372 states, 311 states have (on average 1.3118971061093248) internal successors, (408), 314 states have internal predecessors, (408), 54 states have call successors, (54), 6 states have call predecessors, (54), 6 states have return successors, (54), 51 states have call predecessors, (54), 54 states have call successors, (54) [2025-01-09 15:48:51,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 372 states to 372 states and 516 transitions. [2025-01-09 15:48:51,132 INFO L78 Accepts]: Start accepts. Automaton has 372 states and 516 transitions. Word has length 145 [2025-01-09 15:48:51,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:48:51,134 INFO L471 AbstractCegarLoop]: Abstraction has 372 states and 516 transitions. [2025-01-09 15:48:51,134 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 states have internal predecessors, (58), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-01-09 15:48:51,134 INFO L276 IsEmpty]: Start isEmpty. Operand 372 states and 516 transitions. [2025-01-09 15:48:51,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2025-01-09 15:48:51,137 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:48:51,137 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:48:51,137 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-09 15:48:51,137 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:48:51,138 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:48:51,138 INFO L85 PathProgramCache]: Analyzing trace with hash -1940663575, now seen corresponding path program 1 times [2025-01-09 15:48:51,138 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:48:51,138 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [713569570] [2025-01-09 15:48:51,138 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:48:51,138 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:48:51,158 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 145 statements into 1 equivalence classes. [2025-01-09 15:48:51,178 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 145 of 145 statements. [2025-01-09 15:48:51,179 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:48:51,179 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:48:51,393 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-01-09 15:48:51,393 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:48:51,393 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [713569570] [2025-01-09 15:48:51,393 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [713569570] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:48:51,393 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:48:51,393 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 15:48:51,393 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1079325523] [2025-01-09 15:48:51,393 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:48:51,394 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 15:48:51,394 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:48:51,394 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 15:48:51,394 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-09 15:48:51,394 INFO L87 Difference]: Start difference. First operand 372 states and 516 transitions. Second operand has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-01-09 15:48:51,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:48:51,464 INFO L93 Difference]: Finished difference Result 816 states and 1120 transitions. [2025-01-09 15:48:51,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 15:48:51,465 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 145 [2025-01-09 15:48:51,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:48:51,468 INFO L225 Difference]: With dead ends: 816 [2025-01-09 15:48:51,468 INFO L226 Difference]: Without dead ends: 495 [2025-01-09 15:48:51,469 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-01-09 15:48:51,470 INFO L435 NwaCegarLoop]: 139 mSDtfsCounter, 53 mSDsluCounter, 367 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 506 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 15:48:51,470 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 506 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 15:48:51,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 495 states. [2025-01-09 15:48:51,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 495 to 491. [2025-01-09 15:48:51,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 491 states, 422 states have (on average 1.2962085308056872) internal successors, (547), 427 states have internal predecessors, (547), 58 states have call successors, (58), 10 states have call predecessors, (58), 10 states have return successors, (58), 53 states have call predecessors, (58), 58 states have call successors, (58) [2025-01-09 15:48:51,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 491 states to 491 states and 663 transitions. [2025-01-09 15:48:51,504 INFO L78 Accepts]: Start accepts. Automaton has 491 states and 663 transitions. Word has length 145 [2025-01-09 15:48:51,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:48:51,505 INFO L471 AbstractCegarLoop]: Abstraction has 491 states and 663 transitions. [2025-01-09 15:48:51,505 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-01-09 15:48:51,505 INFO L276 IsEmpty]: Start isEmpty. Operand 491 states and 663 transitions. [2025-01-09 15:48:51,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2025-01-09 15:48:51,507 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:48:51,507 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:48:51,508 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-09 15:48:51,508 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:48:51,509 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:48:51,509 INFO L85 PathProgramCache]: Analyzing trace with hash -36944439, now seen corresponding path program 1 times [2025-01-09 15:48:51,509 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:48:51,509 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [104901099] [2025-01-09 15:48:51,509 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:48:51,509 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:48:51,536 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 147 statements into 1 equivalence classes. [2025-01-09 15:48:51,548 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 147 of 147 statements. [2025-01-09 15:48:51,548 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:48:51,548 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:48:51,587 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-01-09 15:48:51,588 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:48:51,588 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [104901099] [2025-01-09 15:48:51,588 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [104901099] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:48:51,588 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:48:51,588 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 15:48:51,588 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [475373011] [2025-01-09 15:48:51,588 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:48:51,590 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 15:48:51,590 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:48:51,590 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 15:48:51,591 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 15:48:51,591 INFO L87 Difference]: Start difference. First operand 491 states and 663 transitions. Second operand has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-01-09 15:48:51,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:48:51,619 INFO L93 Difference]: Finished difference Result 937 states and 1271 transitions. [2025-01-09 15:48:51,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 15:48:51,620 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 147 [2025-01-09 15:48:51,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:48:51,623 INFO L225 Difference]: With dead ends: 937 [2025-01-09 15:48:51,623 INFO L226 Difference]: Without dead ends: 497 [2025-01-09 15:48:51,627 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 15:48:51,628 INFO L435 NwaCegarLoop]: 133 mSDtfsCounter, 0 mSDsluCounter, 126 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 259 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 15:48:51,628 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 259 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 15:48:51,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 497 states. [2025-01-09 15:48:51,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 497 to 497. [2025-01-09 15:48:51,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 497 states, 428 states have (on average 1.2920560747663552) internal successors, (553), 433 states have internal predecessors, (553), 58 states have call successors, (58), 10 states have call predecessors, (58), 10 states have return successors, (58), 53 states have call predecessors, (58), 58 states have call successors, (58) [2025-01-09 15:48:51,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 497 states to 497 states and 669 transitions. [2025-01-09 15:48:51,660 INFO L78 Accepts]: Start accepts. Automaton has 497 states and 669 transitions. Word has length 147 [2025-01-09 15:48:51,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:48:51,660 INFO L471 AbstractCegarLoop]: Abstraction has 497 states and 669 transitions. [2025-01-09 15:48:51,660 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-01-09 15:48:51,660 INFO L276 IsEmpty]: Start isEmpty. Operand 497 states and 669 transitions. [2025-01-09 15:48:51,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2025-01-09 15:48:51,662 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:48:51,663 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:48:51,663 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-09 15:48:51,663 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:48:51,663 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:48:51,663 INFO L85 PathProgramCache]: Analyzing trace with hash 221220999, now seen corresponding path program 1 times [2025-01-09 15:48:51,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:48:51,664 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [284892623] [2025-01-09 15:48:51,664 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:48:51,664 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:48:51,685 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 147 statements into 1 equivalence classes. [2025-01-09 15:48:51,695 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 147 of 147 statements. [2025-01-09 15:48:51,695 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:48:51,695 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:48:51,855 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 561 trivial. 0 not checked. [2025-01-09 15:48:51,856 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:48:51,856 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [284892623] [2025-01-09 15:48:51,856 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [284892623] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 15:48:51,856 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [115719951] [2025-01-09 15:48:51,856 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:48:51,857 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 15:48:51,857 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 15:48:51,859 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:48:51,861 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:48:52,047 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 147 statements into 1 equivalence classes. [2025-01-09 15:48:52,116 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 147 of 147 statements. [2025-01-09 15:48:52,116 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:48:52,116 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:48:52,120 INFO L256 TraceCheckSpWp]: Trace formula consists of 632 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-01-09 15:48:52,125 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 15:48:52,157 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-01-09 15:48:52,158 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 15:48:52,158 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [115719951] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:48:52,158 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 15:48:52,158 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [8] total 10 [2025-01-09 15:48:52,158 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [480446676] [2025-01-09 15:48:52,158 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:48:52,159 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 15:48:52,159 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:48:52,160 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 15:48:52,160 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2025-01-09 15:48:52,160 INFO L87 Difference]: Start difference. First operand 497 states and 669 transitions. Second operand has 6 states, 6 states have (on average 10.0) internal successors, (60), 6 states have internal predecessors, (60), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-01-09 15:48:52,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:48:52,211 INFO L93 Difference]: Finished difference Result 967 states and 1301 transitions. [2025-01-09 15:48:52,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 15:48:52,211 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.0) internal successors, (60), 6 states have internal predecessors, (60), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 147 [2025-01-09 15:48:52,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:48:52,215 INFO L225 Difference]: With dead ends: 967 [2025-01-09 15:48:52,216 INFO L226 Difference]: Without dead ends: 521 [2025-01-09 15:48:52,217 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 147 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2025-01-09 15:48:52,217 INFO L435 NwaCegarLoop]: 133 mSDtfsCounter, 0 mSDsluCounter, 507 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 640 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 15:48:52,218 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 640 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 15:48:52,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 521 states. [2025-01-09 15:48:52,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 521 to 509. [2025-01-09 15:48:52,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 509 states, 440 states have (on average 1.2840909090909092) internal successors, (565), 445 states have internal predecessors, (565), 58 states have call successors, (58), 10 states have call predecessors, (58), 10 states have return successors, (58), 53 states have call predecessors, (58), 58 states have call successors, (58) [2025-01-09 15:48:52,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 509 states to 509 states and 681 transitions. [2025-01-09 15:48:52,252 INFO L78 Accepts]: Start accepts. Automaton has 509 states and 681 transitions. Word has length 147 [2025-01-09 15:48:52,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:48:52,253 INFO L471 AbstractCegarLoop]: Abstraction has 509 states and 681 transitions. [2025-01-09 15:48:52,253 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.0) internal successors, (60), 6 states have internal predecessors, (60), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-01-09 15:48:52,253 INFO L276 IsEmpty]: Start isEmpty. Operand 509 states and 681 transitions. [2025-01-09 15:48:52,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2025-01-09 15:48:52,254 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:48:52,255 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:48:52,264 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-01-09 15:48:52,457 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 15:48:52,458 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:48:52,459 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:48:52,459 INFO L85 PathProgramCache]: Analyzing trace with hash -1375074173, now seen corresponding path program 1 times [2025-01-09 15:48:52,459 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:48:52,459 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [379185064] [2025-01-09 15:48:52,459 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:48:52,459 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:48:52,483 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 147 statements into 1 equivalence classes. [2025-01-09 15:48:52,496 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 147 of 147 statements. [2025-01-09 15:48:52,497 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:48:52,497 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:48:52,606 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-01-09 15:48:52,607 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:48:52,607 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [379185064] [2025-01-09 15:48:52,607 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [379185064] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:48:52,607 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:48:52,607 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 15:48:52,607 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [317442312] [2025-01-09 15:48:52,608 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:48:52,608 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 15:48:52,608 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:48:52,609 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 15:48:52,609 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 15:48:52,609 INFO L87 Difference]: Start difference. First operand 509 states and 681 transitions. Second operand has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-01-09 15:48:52,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:48:52,756 INFO L93 Difference]: Finished difference Result 1398 states and 1867 transitions. [2025-01-09 15:48:52,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 15:48:52,756 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 147 [2025-01-09 15:48:52,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:48:52,763 INFO L225 Difference]: With dead ends: 1398 [2025-01-09 15:48:52,763 INFO L226 Difference]: Without dead ends: 940 [2025-01-09 15:48:52,764 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-01-09 15:48:52,765 INFO L435 NwaCegarLoop]: 166 mSDtfsCounter, 83 mSDsluCounter, 419 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 585 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 15:48:52,766 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 585 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 15:48:52,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 940 states. [2025-01-09 15:48:52,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 940 to 937. [2025-01-09 15:48:52,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 937 states, 826 states have (on average 1.284503631961259) internal successors, (1061), 837 states have internal predecessors, (1061), 92 states have call successors, (92), 18 states have call predecessors, (92), 18 states have return successors, (92), 81 states have call predecessors, (92), 92 states have call successors, (92) [2025-01-09 15:48:52,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 937 states to 937 states and 1245 transitions. [2025-01-09 15:48:52,820 INFO L78 Accepts]: Start accepts. Automaton has 937 states and 1245 transitions. Word has length 147 [2025-01-09 15:48:52,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:48:52,821 INFO L471 AbstractCegarLoop]: Abstraction has 937 states and 1245 transitions. [2025-01-09 15:48:52,821 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-01-09 15:48:52,821 INFO L276 IsEmpty]: Start isEmpty. Operand 937 states and 1245 transitions. [2025-01-09 15:48:52,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2025-01-09 15:48:52,824 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:48:52,824 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:48:52,824 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-01-09 15:48:52,824 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:48:52,825 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:48:52,825 INFO L85 PathProgramCache]: Analyzing trace with hash -695015803, now seen corresponding path program 1 times [2025-01-09 15:48:52,825 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:48:52,825 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [707562800] [2025-01-09 15:48:52,825 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:48:52,825 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:48:52,848 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 147 statements into 1 equivalence classes. [2025-01-09 15:48:52,959 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 147 of 147 statements. [2025-01-09 15:48:52,960 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:48:52,960 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 15:48:52,960 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-09 15:48:52,970 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 147 statements into 1 equivalence classes. [2025-01-09 15:48:53,081 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 147 of 147 statements. [2025-01-09 15:48:53,081 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:48:53,081 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 15:48:53,215 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-09 15:48:53,215 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-09 15:48:53,216 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-01-09 15:48:53,219 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-01-09 15:48:53,222 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:48:53,455 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-09 15:48:53,459 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.01 03:48:53 BoogieIcfgContainer [2025-01-09 15:48:53,460 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-09 15:48:53,461 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-09 15:48:53,461 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-09 15:48:53,461 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-09 15:48:53,462 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 03:48:36" (3/4) ... [2025-01-09 15:48:53,464 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-01-09 15:48:53,465 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-09 15:48:53,466 INFO L158 Benchmark]: Toolchain (without parser) took 18470.74ms. Allocated memory was 142.6MB in the beginning and 469.8MB in the end (delta: 327.2MB). Free memory was 106.0MB in the beginning and 263.9MB in the end (delta: -157.9MB). Peak memory consumption was 174.8MB. Max. memory is 16.1GB. [2025-01-09 15:48:53,466 INFO L158 Benchmark]: CDTParser took 0.24ms. Allocated memory is still 201.3MB. Free memory is still 125.8MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 15:48:53,466 INFO L158 Benchmark]: CACSL2BoogieTranslator took 315.94ms. Allocated memory is still 142.6MB. Free memory was 106.0MB in the beginning and 92.0MB in the end (delta: 14.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-01-09 15:48:53,467 INFO L158 Benchmark]: Boogie Procedure Inliner took 59.38ms. Allocated memory is still 142.6MB. Free memory was 92.0MB in the beginning and 89.2MB in the end (delta: 2.8MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 15:48:53,467 INFO L158 Benchmark]: Boogie Preprocessor took 88.64ms. Allocated memory is still 142.6MB. Free memory was 89.2MB in the beginning and 85.6MB in the end (delta: 3.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 15:48:53,467 INFO L158 Benchmark]: RCFGBuilder took 817.91ms. Allocated memory is still 142.6MB. Free memory was 84.6MB in the beginning and 49.2MB in the end (delta: 35.4MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2025-01-09 15:48:53,467 INFO L158 Benchmark]: TraceAbstraction took 17176.12ms. Allocated memory was 142.6MB in the beginning and 469.8MB in the end (delta: 327.2MB). Free memory was 48.3MB in the beginning and 264.0MB in the end (delta: -215.7MB). Peak memory consumption was 107.7MB. Max. memory is 16.1GB. [2025-01-09 15:48:53,469 INFO L158 Benchmark]: Witness Printer took 4.25ms. Allocated memory is still 469.8MB. Free memory was 264.0MB in the beginning and 263.9MB in the end (delta: 147.7kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 15:48:53,471 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.24ms. Allocated memory is still 201.3MB. Free memory is still 125.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 315.94ms. Allocated memory is still 142.6MB. Free memory was 106.0MB in the beginning and 92.0MB in the end (delta: 14.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 59.38ms. Allocated memory is still 142.6MB. Free memory was 92.0MB in the beginning and 89.2MB in the end (delta: 2.8MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 88.64ms. Allocated memory is still 142.6MB. Free memory was 89.2MB in the beginning and 85.6MB in the end (delta: 3.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 817.91ms. Allocated memory is still 142.6MB. Free memory was 84.6MB in the beginning and 49.2MB in the end (delta: 35.4MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * TraceAbstraction took 17176.12ms. Allocated memory was 142.6MB in the beginning and 469.8MB in the end (delta: 327.2MB). Free memory was 48.3MB in the beginning and 264.0MB in the end (delta: -215.7MB). Peak memory consumption was 107.7MB. Max. memory is 16.1GB. * Witness Printer took 4.25ms. Allocated memory is still 469.8MB. Free memory was 264.0MB in the beginning and 263.9MB in the end (delta: 147.7kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 114. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed long int var_1_1 = 1; [L22] signed long int var_1_1 = 1; [L23] signed long int* var_1_1_Pointer = &(var_1_1); [L24] unsigned char var_1_4 = 0; [L24] unsigned char var_1_4 = 0; [L25] unsigned char* var_1_4_Pointer = &(var_1_4); [L26] unsigned char var_1_5 = 0; [L26] unsigned char var_1_5 = 0; [L27] unsigned char* var_1_5_Pointer = &(var_1_5); [L28] unsigned char var_1_6 = 1; [L28] unsigned char var_1_6 = 1; [L29] unsigned char* var_1_6_Pointer = &(var_1_6); [L30] signed char var_1_9 = 64; [L30] signed char var_1_9 = 64; [L31] signed char* var_1_9_Pointer = &(var_1_9); [L32] signed char var_1_10 = 4; [L32] signed char var_1_10 = 4; [L33] signed char* var_1_10_Pointer = &(var_1_10); [L34] signed char var_1_11 = -4; [L34] signed char var_1_11 = -4; [L35] signed char* var_1_11_Pointer = &(var_1_11); [L36] signed char var_1_12 = 32; [L36] signed char var_1_12 = 32; [L37] signed char* var_1_12_Pointer = &(var_1_12); [L38] signed char var_1_13 = 32; [L38] signed char var_1_13 = 32; [L39] signed char* var_1_13_Pointer = &(var_1_13); [L40] signed char var_1_14 = -64; [L40] signed char var_1_14 = -64; [L41] signed char* var_1_14_Pointer = &(var_1_14); [L42] signed char var_1_15 = 50; [L42] signed char var_1_15 = 50; [L43] signed char* var_1_15_Pointer = &(var_1_15); [L44] signed char var_1_16 = 16; [L44] signed char var_1_16 = 16; [L45] signed char* var_1_16_Pointer = &(var_1_16); [L46] float var_1_17 = 63.5; [L46] float var_1_17 = 63.5; [L47] float* var_1_17_Pointer = &(var_1_17); [L48] signed char last_1_var_1_9 = 64; [L49] signed char last_1_var_1_14 = -64; VAL [isInitial=0, last_1_var_1_14=-64, last_1_var_1_9=64, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_11={10:0}, var_1_11_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_13={12:0}, var_1_13_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L118] isInitial = 1 [L119] FCALL initially() [L121] CALL updateLastVariables() [L110] EXPR \read(var_1_9) [L110] last_1_var_1_9 = var_1_9 [L111] EXPR \read(var_1_14) [L111] last_1_var_1_14 = var_1_14 [L121] RET updateLastVariables() [L122] CALL updateVariables() [L81] var_1_4 = __VERIFIER_nondet_uchar() [L82] EXPR \read(var_1_4) VAL [isInitial=1, last_1_var_1_14=-64, last_1_var_1_9=64, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_11={10:0}, var_1_11_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_13={12:0}, var_1_13_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L82] CALL assume_abort_if_not(var_1_4 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-64, last_1_var_1_9=64, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_11={10:0}, var_1_11_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_13={12:0}, var_1_13_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-64, last_1_var_1_9=64, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_11={10:0}, var_1_11_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_13={12:0}, var_1_13_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L82] RET assume_abort_if_not(var_1_4 >= 0) VAL [isInitial=1, last_1_var_1_14=-64, last_1_var_1_9=64, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_11={10:0}, var_1_11_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_13={12:0}, var_1_13_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L83] EXPR \read(var_1_4) VAL [isInitial=1, last_1_var_1_14=-64, last_1_var_1_9=64, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_11={10:0}, var_1_11_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_13={12:0}, var_1_13_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L83] CALL assume_abort_if_not(var_1_4 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-64, last_1_var_1_9=64, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_11={10:0}, var_1_11_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_13={12:0}, var_1_13_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-64, last_1_var_1_9=64, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_11={10:0}, var_1_11_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_13={12:0}, var_1_13_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L83] RET assume_abort_if_not(var_1_4 <= 1) VAL [isInitial=1, last_1_var_1_14=-64, last_1_var_1_9=64, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_11={10:0}, var_1_11_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_13={12:0}, var_1_13_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L84] var_1_5 = __VERIFIER_nondet_uchar() [L85] EXPR \read(var_1_5) VAL [isInitial=1, last_1_var_1_14=-64, last_1_var_1_9=64, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_11={10:0}, var_1_11_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_13={12:0}, var_1_13_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L85] CALL assume_abort_if_not(var_1_5 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-64, last_1_var_1_9=64, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_11={10:0}, var_1_11_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_13={12:0}, var_1_13_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-64, last_1_var_1_9=64, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_11={10:0}, var_1_11_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_13={12:0}, var_1_13_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L85] RET assume_abort_if_not(var_1_5 >= 0) VAL [isInitial=1, last_1_var_1_14=-64, last_1_var_1_9=64, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_11={10:0}, var_1_11_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_13={12:0}, var_1_13_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L86] EXPR \read(var_1_5) VAL [isInitial=1, last_1_var_1_14=-64, last_1_var_1_9=64, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_11={10:0}, var_1_11_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_13={12:0}, var_1_13_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L86] CALL assume_abort_if_not(var_1_5 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-64, last_1_var_1_9=64, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_11={10:0}, var_1_11_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_13={12:0}, var_1_13_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-64, last_1_var_1_9=64, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_11={10:0}, var_1_11_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_13={12:0}, var_1_13_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L86] RET assume_abort_if_not(var_1_5 <= 1) VAL [isInitial=1, last_1_var_1_14=-64, last_1_var_1_9=64, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_11={10:0}, var_1_11_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_13={12:0}, var_1_13_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L87] var_1_6 = __VERIFIER_nondet_uchar() [L88] EXPR \read(var_1_6) VAL [isInitial=1, last_1_var_1_14=-64, last_1_var_1_9=64, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_11={10:0}, var_1_11_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_13={12:0}, var_1_13_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L88] CALL assume_abort_if_not(var_1_6 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-64, last_1_var_1_9=64, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_11={10:0}, var_1_11_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_13={12:0}, var_1_13_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-64, last_1_var_1_9=64, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_11={10:0}, var_1_11_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_13={12:0}, var_1_13_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L88] RET assume_abort_if_not(var_1_6 >= 0) VAL [isInitial=1, last_1_var_1_14=-64, last_1_var_1_9=64, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_11={10:0}, var_1_11_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_13={12:0}, var_1_13_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L89] EXPR \read(var_1_6) VAL [isInitial=1, last_1_var_1_14=-64, last_1_var_1_9=64, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_11={10:0}, var_1_11_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_13={12:0}, var_1_13_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L89] CALL assume_abort_if_not(var_1_6 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-64, last_1_var_1_9=64, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_11={10:0}, var_1_11_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_13={12:0}, var_1_13_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-64, last_1_var_1_9=64, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_11={10:0}, var_1_11_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_13={12:0}, var_1_13_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L89] RET assume_abort_if_not(var_1_6 <= 1) VAL [isInitial=1, last_1_var_1_14=-64, last_1_var_1_9=64, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_11={10:0}, var_1_11_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_13={12:0}, var_1_13_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L90] var_1_10 = __VERIFIER_nondet_char() [L91] EXPR \read(var_1_10) VAL [isInitial=1, last_1_var_1_14=-64, last_1_var_1_9=64, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_11={10:0}, var_1_11_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_13={12:0}, var_1_13_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L91] CALL assume_abort_if_not(var_1_10 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-64, last_1_var_1_9=64, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_11={10:0}, var_1_11_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_13={12:0}, var_1_13_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-64, last_1_var_1_9=64, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_11={10:0}, var_1_11_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_13={12:0}, var_1_13_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L91] RET assume_abort_if_not(var_1_10 >= -127) VAL [isInitial=1, last_1_var_1_14=-64, last_1_var_1_9=64, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_11={10:0}, var_1_11_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_13={12:0}, var_1_13_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L92] EXPR \read(var_1_10) VAL [isInitial=1, last_1_var_1_14=-64, last_1_var_1_9=64, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_11={10:0}, var_1_11_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_13={12:0}, var_1_13_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L92] CALL assume_abort_if_not(var_1_10 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-64, last_1_var_1_9=64, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_11={10:0}, var_1_11_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_13={12:0}, var_1_13_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-64, last_1_var_1_9=64, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_11={10:0}, var_1_11_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_13={12:0}, var_1_13_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L92] RET assume_abort_if_not(var_1_10 <= 126) VAL [isInitial=1, last_1_var_1_14=-64, last_1_var_1_9=64, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_11={10:0}, var_1_11_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_13={12:0}, var_1_13_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L93] var_1_11 = __VERIFIER_nondet_char() [L94] EXPR \read(var_1_11) VAL [isInitial=1, last_1_var_1_14=-64, last_1_var_1_9=64, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_11={10:0}, var_1_11_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_13={12:0}, var_1_13_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L94] CALL assume_abort_if_not(var_1_11 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-64, last_1_var_1_9=64, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_11={10:0}, var_1_11_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_13={12:0}, var_1_13_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-64, last_1_var_1_9=64, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_11={10:0}, var_1_11_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_13={12:0}, var_1_13_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L94] RET assume_abort_if_not(var_1_11 >= -127) VAL [isInitial=1, last_1_var_1_14=-64, last_1_var_1_9=64, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_11={10:0}, var_1_11_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_13={12:0}, var_1_13_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L95] EXPR \read(var_1_11) VAL [isInitial=1, last_1_var_1_14=-64, last_1_var_1_9=64, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_11={10:0}, var_1_11_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_13={12:0}, var_1_13_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L95] CALL assume_abort_if_not(var_1_11 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-64, last_1_var_1_9=64, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_11={10:0}, var_1_11_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_13={12:0}, var_1_13_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-64, last_1_var_1_9=64, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_11={10:0}, var_1_11_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_13={12:0}, var_1_13_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L95] RET assume_abort_if_not(var_1_11 <= 126) VAL [isInitial=1, last_1_var_1_14=-64, last_1_var_1_9=64, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_11={10:0}, var_1_11_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_13={12:0}, var_1_13_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L96] var_1_12 = __VERIFIER_nondet_char() [L97] EXPR \read(var_1_12) VAL [isInitial=1, last_1_var_1_14=-64, last_1_var_1_9=64, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_11={10:0}, var_1_11_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_13={12:0}, var_1_13_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L97] CALL assume_abort_if_not(var_1_12 >= -1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-64, last_1_var_1_9=64, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_11={10:0}, var_1_11_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_13={12:0}, var_1_13_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-64, last_1_var_1_9=64, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_11={10:0}, var_1_11_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_13={12:0}, var_1_13_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L97] RET assume_abort_if_not(var_1_12 >= -1) VAL [isInitial=1, last_1_var_1_14=-64, last_1_var_1_9=64, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_11={10:0}, var_1_11_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_13={12:0}, var_1_13_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L98] EXPR \read(var_1_12) VAL [isInitial=1, last_1_var_1_14=-64, last_1_var_1_9=64, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_11={10:0}, var_1_11_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_13={12:0}, var_1_13_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L98] CALL assume_abort_if_not(var_1_12 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-64, last_1_var_1_9=64, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_11={10:0}, var_1_11_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_13={12:0}, var_1_13_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-64, last_1_var_1_9=64, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_11={10:0}, var_1_11_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_13={12:0}, var_1_13_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L98] RET assume_abort_if_not(var_1_12 <= 126) VAL [isInitial=1, last_1_var_1_14=-64, last_1_var_1_9=64, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_11={10:0}, var_1_11_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_13={12:0}, var_1_13_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L99] var_1_13 = __VERIFIER_nondet_char() [L100] EXPR \read(var_1_13) VAL [isInitial=1, last_1_var_1_14=-64, last_1_var_1_9=64, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_11={10:0}, var_1_11_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_13={12:0}, var_1_13_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L100] CALL assume_abort_if_not(var_1_13 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-64, last_1_var_1_9=64, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_11={10:0}, var_1_11_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_13={12:0}, var_1_13_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-64, last_1_var_1_9=64, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_11={10:0}, var_1_11_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_13={12:0}, var_1_13_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L100] RET assume_abort_if_not(var_1_13 >= 0) VAL [isInitial=1, last_1_var_1_14=-64, last_1_var_1_9=64, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_11={10:0}, var_1_11_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_13={12:0}, var_1_13_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L101] EXPR \read(var_1_13) VAL [isInitial=1, last_1_var_1_14=-64, last_1_var_1_9=64, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_11={10:0}, var_1_11_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_13={12:0}, var_1_13_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L101] CALL assume_abort_if_not(var_1_13 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-64, last_1_var_1_9=64, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_11={10:0}, var_1_11_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_13={12:0}, var_1_13_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-64, last_1_var_1_9=64, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_11={10:0}, var_1_11_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_13={12:0}, var_1_13_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L101] RET assume_abort_if_not(var_1_13 <= 126) VAL [isInitial=1, last_1_var_1_14=-64, last_1_var_1_9=64, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_11={10:0}, var_1_11_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_13={12:0}, var_1_13_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L102] var_1_15 = __VERIFIER_nondet_char() [L103] EXPR \read(var_1_15) VAL [isInitial=1, last_1_var_1_14=-64, last_1_var_1_9=64, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_11={10:0}, var_1_11_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_13={12:0}, var_1_13_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L103] CALL assume_abort_if_not(var_1_15 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-64, last_1_var_1_9=64, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_11={10:0}, var_1_11_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_13={12:0}, var_1_13_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-64, last_1_var_1_9=64, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_11={10:0}, var_1_11_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_13={12:0}, var_1_13_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L103] RET assume_abort_if_not(var_1_15 >= 0) VAL [isInitial=1, last_1_var_1_14=-64, last_1_var_1_9=64, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_11={10:0}, var_1_11_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_13={12:0}, var_1_13_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L104] EXPR \read(var_1_15) VAL [isInitial=1, last_1_var_1_14=-64, last_1_var_1_9=64, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_11={10:0}, var_1_11_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_13={12:0}, var_1_13_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L104] CALL assume_abort_if_not(var_1_15 <= 64) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-64, last_1_var_1_9=64, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_11={10:0}, var_1_11_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_13={12:0}, var_1_13_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-64, last_1_var_1_9=64, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_11={10:0}, var_1_11_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_13={12:0}, var_1_13_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L104] RET assume_abort_if_not(var_1_15 <= 64) VAL [isInitial=1, last_1_var_1_14=-64, last_1_var_1_9=64, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_11={10:0}, var_1_11_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_13={12:0}, var_1_13_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L105] var_1_16 = __VERIFIER_nondet_char() [L106] EXPR \read(var_1_16) VAL [isInitial=1, last_1_var_1_14=-64, last_1_var_1_9=64, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_11={10:0}, var_1_11_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_13={12:0}, var_1_13_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L106] CALL assume_abort_if_not(var_1_16 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-64, last_1_var_1_9=64, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_11={10:0}, var_1_11_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_13={12:0}, var_1_13_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-64, last_1_var_1_9=64, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_11={10:0}, var_1_11_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_13={12:0}, var_1_13_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L106] RET assume_abort_if_not(var_1_16 >= 0) VAL [isInitial=1, last_1_var_1_14=-64, last_1_var_1_9=64, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_11={10:0}, var_1_11_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_13={12:0}, var_1_13_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L107] EXPR \read(var_1_16) VAL [isInitial=1, last_1_var_1_14=-64, last_1_var_1_9=64, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_11={10:0}, var_1_11_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_13={12:0}, var_1_13_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L107] CALL assume_abort_if_not(var_1_16 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-64, last_1_var_1_9=64, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_11={10:0}, var_1_11_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_13={12:0}, var_1_13_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-64, last_1_var_1_9=64, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_11={10:0}, var_1_11_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_13={12:0}, var_1_13_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L107] RET assume_abort_if_not(var_1_16 <= 63) VAL [isInitial=1, last_1_var_1_14=-64, last_1_var_1_9=64, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_11={10:0}, var_1_11_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_13={12:0}, var_1_13_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L122] RET updateVariables() [L123] CALL step() [L53] EXPR \read(*var_1_6_Pointer) [L53] unsigned char stepLocal_0 = (*(var_1_6_Pointer)); [L54] COND TRUE ! (last_1_var_1_14 >= last_1_var_1_9) [L55] EXPR \read(*var_1_4_Pointer) [L55] EXPR (*(var_1_4_Pointer)) || (*(var_1_5_Pointer)) VAL [isInitial=1, last_1_var_1_14=-64, last_1_var_1_9=64, stepLocal_0=-255, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_11={10:0}, var_1_11_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_13={12:0}, var_1_13_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L55] EXPR (*(var_1_4_Pointer)) || (*(var_1_5_Pointer)) [L55] EXPR \read(*var_1_5_Pointer) [L55] EXPR (*(var_1_4_Pointer)) || (*(var_1_5_Pointer)) VAL [isInitial=1, last_1_var_1_14=-64, last_1_var_1_9=64, stepLocal_0=-255, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_11={10:0}, var_1_11_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_13={12:0}, var_1_13_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L55] COND TRUE ((*(var_1_4_Pointer)) || (*(var_1_5_Pointer))) && stepLocal_0 [L56] (*(var_1_1_Pointer)) = ((((last_1_var_1_9) < (last_1_var_1_14)) ? (last_1_var_1_9) : (last_1_var_1_14))) VAL [isInitial=1, last_1_var_1_14=-64, last_1_var_1_9=64, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_11={10:0}, var_1_11_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_13={12:0}, var_1_13_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L63] EXPR \read(*var_1_15_Pointer) [L63] EXPR \read(*var_1_16_Pointer) [L63] EXPR \read(*var_1_13_Pointer) VAL [isInitial=1, last_1_var_1_14=-64, last_1_var_1_9=64, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_11={10:0}, var_1_11_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_13={12:0}, var_1_13_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L63] EXPR ((64) > ((*(var_1_13_Pointer)))) ? (64) : ((*(var_1_13_Pointer))) [L63] EXPR \read(*var_1_13_Pointer) [L63] EXPR ((64) > ((*(var_1_13_Pointer)))) ? (64) : ((*(var_1_13_Pointer))) VAL [isInitial=1, last_1_var_1_14=-64, last_1_var_1_9=64, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_11={10:0}, var_1_11_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_13={12:0}, var_1_13_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L63] signed long int stepLocal_3 = ((*(var_1_15_Pointer)) + (*(var_1_16_Pointer))) - ((((64) > ((*(var_1_13_Pointer)))) ? (64) : ((*(var_1_13_Pointer))))); [L64] EXPR \read(*var_1_12_Pointer) VAL [isInitial=1, last_1_var_1_14=-64, last_1_var_1_9=64, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_11={10:0}, var_1_11_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_13={12:0}, var_1_13_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L64] COND TRUE (*(var_1_12_Pointer)) < stepLocal_3 [L65] EXPR \read(*var_1_16_Pointer) [L65] EXPR \read(*var_1_13_Pointer) [L65] (*(var_1_14_Pointer)) = ((64 - (*(var_1_16_Pointer))) - (*(var_1_13_Pointer))) [L69] (*(var_1_17_Pointer)) = 128.91f [L70] EXPR \read(*var_1_14_Pointer) [L70] EXPR \read(*var_1_1_Pointer) [L70] unsigned char stepLocal_2 = (*(var_1_14_Pointer)) == (*(var_1_1_Pointer)); [L71] EXPR \read(*var_1_5_Pointer) [L71] unsigned char stepLocal_1 = (*(var_1_5_Pointer)); [L72] stepLocal_1 && (*(var_1_4_Pointer)) VAL [isInitial=1, last_1_var_1_14=-64, last_1_var_1_9=64, stepLocal_2=0, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_11={10:0}, var_1_11_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_13={12:0}, var_1_13_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L72] stepLocal_1 && (*(var_1_4_Pointer)) [L72] EXPR \read(*var_1_4_Pointer) [L72] stepLocal_1 && (*(var_1_4_Pointer)) VAL [isInitial=1, last_1_var_1_14=-64, last_1_var_1_9=64, stepLocal_2=0, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_11={10:0}, var_1_11_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_13={12:0}, var_1_13_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L72] COND FALSE !(stepLocal_1 && (*(var_1_4_Pointer))) [L77] EXPR \read(*var_1_12_Pointer) [L77] EXPR \read(*var_1_13_Pointer) [L77] (*(var_1_9_Pointer)) = ((*(var_1_12_Pointer)) - (*(var_1_13_Pointer))) [L123] RET step() [L124] CALL, EXPR property() [L114] EXPR (! (last_1_var_1_14 >= last_1_var_1_9)) ? ((((*(var_1_4_Pointer)) || (*(var_1_5_Pointer))) && (*(var_1_6_Pointer))) ? ((*(var_1_1_Pointer)) == ((signed long int) ((((last_1_var_1_9) < (last_1_var_1_14)) ? (last_1_var_1_9) : (last_1_var_1_14))))) : ((*(var_1_1_Pointer)) == ((signed long int) last_1_var_1_14))) : ((*(var_1_1_Pointer)) == ((signed long int) last_1_var_1_14)) [L114] EXPR \read(*var_1_4_Pointer) [L114] EXPR (*(var_1_4_Pointer)) || (*(var_1_5_Pointer)) VAL [isInitial=1, last_1_var_1_14=-64, last_1_var_1_9=64, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_11={10:0}, var_1_11_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_13={12:0}, var_1_13_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L114] EXPR (*(var_1_4_Pointer)) || (*(var_1_5_Pointer)) [L114] EXPR \read(*var_1_5_Pointer) [L114] EXPR (*(var_1_4_Pointer)) || (*(var_1_5_Pointer)) VAL [isInitial=1, last_1_var_1_14=-64, last_1_var_1_9=64, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_11={10:0}, var_1_11_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_13={12:0}, var_1_13_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L114] EXPR ((*(var_1_4_Pointer)) || (*(var_1_5_Pointer))) && (*(var_1_6_Pointer)) VAL [isInitial=1, last_1_var_1_14=-64, last_1_var_1_9=64, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_11={10:0}, var_1_11_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_13={12:0}, var_1_13_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L114] EXPR ((*(var_1_4_Pointer)) || (*(var_1_5_Pointer))) && (*(var_1_6_Pointer)) [L114] EXPR \read(*var_1_6_Pointer) [L114] EXPR ((*(var_1_4_Pointer)) || (*(var_1_5_Pointer))) && (*(var_1_6_Pointer)) VAL [isInitial=1, last_1_var_1_14=-64, last_1_var_1_9=64, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_11={10:0}, var_1_11_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_13={12:0}, var_1_13_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L114] EXPR (((*(var_1_4_Pointer)) || (*(var_1_5_Pointer))) && (*(var_1_6_Pointer))) ? ((*(var_1_1_Pointer)) == ((signed long int) ((((last_1_var_1_9) < (last_1_var_1_14)) ? (last_1_var_1_9) : (last_1_var_1_14))))) : ((*(var_1_1_Pointer)) == ((signed long int) last_1_var_1_14)) [L114] EXPR \read(*var_1_1_Pointer) [L114] EXPR (((*(var_1_4_Pointer)) || (*(var_1_5_Pointer))) && (*(var_1_6_Pointer))) ? ((*(var_1_1_Pointer)) == ((signed long int) ((((last_1_var_1_9) < (last_1_var_1_14)) ? (last_1_var_1_9) : (last_1_var_1_14))))) : ((*(var_1_1_Pointer)) == ((signed long int) last_1_var_1_14)) VAL [isInitial=1, last_1_var_1_14=-64, last_1_var_1_9=64, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_11={10:0}, var_1_11_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_13={12:0}, var_1_13_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L114] EXPR (! (last_1_var_1_14 >= last_1_var_1_9)) ? ((((*(var_1_4_Pointer)) || (*(var_1_5_Pointer))) && (*(var_1_6_Pointer))) ? ((*(var_1_1_Pointer)) == ((signed long int) ((((last_1_var_1_9) < (last_1_var_1_14)) ? (last_1_var_1_9) : (last_1_var_1_14))))) : ((*(var_1_1_Pointer)) == ((signed long int) last_1_var_1_14))) : ((*(var_1_1_Pointer)) == ((signed long int) last_1_var_1_14)) VAL [isInitial=1, last_1_var_1_14=-64, last_1_var_1_9=64, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_11={10:0}, var_1_11_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_13={12:0}, var_1_13_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L114] EXPR ((! (last_1_var_1_14 >= last_1_var_1_9)) ? ((((*(var_1_4_Pointer)) || (*(var_1_5_Pointer))) && (*(var_1_6_Pointer))) ? ((*(var_1_1_Pointer)) == ((signed long int) ((((last_1_var_1_9) < (last_1_var_1_14)) ? (last_1_var_1_9) : (last_1_var_1_14))))) : ((*(var_1_1_Pointer)) == ((signed long int) last_1_var_1_14))) : ((*(var_1_1_Pointer)) == ((signed long int) last_1_var_1_14))) && (((*(var_1_5_Pointer)) && (*(var_1_4_Pointer))) ? (((*(var_1_6_Pointer)) || ((*(var_1_14_Pointer)) == (*(var_1_1_Pointer)))) ? ((*(var_1_9_Pointer)) == ((signed char) (((((*(var_1_10_Pointer))) < ((*(var_1_11_Pointer)))) ? ((*(var_1_10_Pointer))) : ((*(var_1_11_Pointer))))))) : 1) : ((*(var_1_9_Pointer)) == ((signed char) ((*(var_1_12_Pointer)) - (*(var_1_13_Pointer)))))) VAL [isInitial=1, last_1_var_1_14=-64, last_1_var_1_9=64, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_11={10:0}, var_1_11_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_13={12:0}, var_1_13_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L114] EXPR ((! (last_1_var_1_14 >= last_1_var_1_9)) ? ((((*(var_1_4_Pointer)) || (*(var_1_5_Pointer))) && (*(var_1_6_Pointer))) ? ((*(var_1_1_Pointer)) == ((signed long int) ((((last_1_var_1_9) < (last_1_var_1_14)) ? (last_1_var_1_9) : (last_1_var_1_14))))) : ((*(var_1_1_Pointer)) == ((signed long int) last_1_var_1_14))) : ((*(var_1_1_Pointer)) == ((signed long int) last_1_var_1_14))) && (((*(var_1_5_Pointer)) && (*(var_1_4_Pointer))) ? (((*(var_1_6_Pointer)) || ((*(var_1_14_Pointer)) == (*(var_1_1_Pointer)))) ? ((*(var_1_9_Pointer)) == ((signed char) (((((*(var_1_10_Pointer))) < ((*(var_1_11_Pointer)))) ? ((*(var_1_10_Pointer))) : ((*(var_1_11_Pointer))))))) : 1) : ((*(var_1_9_Pointer)) == ((signed char) ((*(var_1_12_Pointer)) - (*(var_1_13_Pointer)))))) [L114] EXPR \read(*var_1_5_Pointer) [L114] EXPR (*(var_1_5_Pointer)) && (*(var_1_4_Pointer)) VAL [isInitial=1, last_1_var_1_14=-64, last_1_var_1_9=64, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_11={10:0}, var_1_11_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_13={12:0}, var_1_13_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L114] EXPR (*(var_1_5_Pointer)) && (*(var_1_4_Pointer)) [L114] EXPR \read(*var_1_4_Pointer) [L114] EXPR (*(var_1_5_Pointer)) && (*(var_1_4_Pointer)) VAL [isInitial=1, last_1_var_1_14=-64, last_1_var_1_9=64, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_11={10:0}, var_1_11_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_13={12:0}, var_1_13_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L114] EXPR ((*(var_1_5_Pointer)) && (*(var_1_4_Pointer))) ? (((*(var_1_6_Pointer)) || ((*(var_1_14_Pointer)) == (*(var_1_1_Pointer)))) ? ((*(var_1_9_Pointer)) == ((signed char) (((((*(var_1_10_Pointer))) < ((*(var_1_11_Pointer)))) ? ((*(var_1_10_Pointer))) : ((*(var_1_11_Pointer))))))) : 1) : ((*(var_1_9_Pointer)) == ((signed char) ((*(var_1_12_Pointer)) - (*(var_1_13_Pointer))))) [L114] EXPR \read(*var_1_9_Pointer) [L114] EXPR \read(*var_1_12_Pointer) [L114] EXPR \read(*var_1_13_Pointer) [L114] EXPR ((*(var_1_5_Pointer)) && (*(var_1_4_Pointer))) ? (((*(var_1_6_Pointer)) || ((*(var_1_14_Pointer)) == (*(var_1_1_Pointer)))) ? ((*(var_1_9_Pointer)) == ((signed char) (((((*(var_1_10_Pointer))) < ((*(var_1_11_Pointer)))) ? ((*(var_1_10_Pointer))) : ((*(var_1_11_Pointer))))))) : 1) : ((*(var_1_9_Pointer)) == ((signed char) ((*(var_1_12_Pointer)) - (*(var_1_13_Pointer))))) VAL [isInitial=1, last_1_var_1_14=-64, last_1_var_1_9=64, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_11={10:0}, var_1_11_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_13={12:0}, var_1_13_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L114] EXPR ((! (last_1_var_1_14 >= last_1_var_1_9)) ? ((((*(var_1_4_Pointer)) || (*(var_1_5_Pointer))) && (*(var_1_6_Pointer))) ? ((*(var_1_1_Pointer)) == ((signed long int) ((((last_1_var_1_9) < (last_1_var_1_14)) ? (last_1_var_1_9) : (last_1_var_1_14))))) : ((*(var_1_1_Pointer)) == ((signed long int) last_1_var_1_14))) : ((*(var_1_1_Pointer)) == ((signed long int) last_1_var_1_14))) && (((*(var_1_5_Pointer)) && (*(var_1_4_Pointer))) ? (((*(var_1_6_Pointer)) || ((*(var_1_14_Pointer)) == (*(var_1_1_Pointer)))) ? ((*(var_1_9_Pointer)) == ((signed char) (((((*(var_1_10_Pointer))) < ((*(var_1_11_Pointer)))) ? ((*(var_1_10_Pointer))) : ((*(var_1_11_Pointer))))))) : 1) : ((*(var_1_9_Pointer)) == ((signed char) ((*(var_1_12_Pointer)) - (*(var_1_13_Pointer)))))) VAL [isInitial=1, last_1_var_1_14=-64, last_1_var_1_9=64, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_11={10:0}, var_1_11_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_13={12:0}, var_1_13_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L114] EXPR (((! (last_1_var_1_14 >= last_1_var_1_9)) ? ((((*(var_1_4_Pointer)) || (*(var_1_5_Pointer))) && (*(var_1_6_Pointer))) ? ((*(var_1_1_Pointer)) == ((signed long int) ((((last_1_var_1_9) < (last_1_var_1_14)) ? (last_1_var_1_9) : (last_1_var_1_14))))) : ((*(var_1_1_Pointer)) == ((signed long int) last_1_var_1_14))) : ((*(var_1_1_Pointer)) == ((signed long int) last_1_var_1_14))) && (((*(var_1_5_Pointer)) && (*(var_1_4_Pointer))) ? (((*(var_1_6_Pointer)) || ((*(var_1_14_Pointer)) == (*(var_1_1_Pointer)))) ? ((*(var_1_9_Pointer)) == ((signed char) (((((*(var_1_10_Pointer))) < ((*(var_1_11_Pointer)))) ? ((*(var_1_10_Pointer))) : ((*(var_1_11_Pointer))))))) : 1) : ((*(var_1_9_Pointer)) == ((signed char) ((*(var_1_12_Pointer)) - (*(var_1_13_Pointer))))))) && (((*(var_1_12_Pointer)) < (((*(var_1_15_Pointer)) + (*(var_1_16_Pointer))) - ((((64) > ((*(var_1_13_Pointer)))) ? (64) : ((*(var_1_13_Pointer))))))) ? ((*(var_1_14_Pointer)) == ((signed char) ((64 - (*(var_1_16_Pointer))) - (*(var_1_13_Pointer))))) : ((*(var_1_14_Pointer)) == ((signed char) (((((*(var_1_10_Pointer))) < ((*(var_1_11_Pointer)))) ? ((*(var_1_10_Pointer))) : ((*(var_1_11_Pointer)))))))) VAL [isInitial=1, last_1_var_1_14=-64, last_1_var_1_9=64, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_11={10:0}, var_1_11_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_13={12:0}, var_1_13_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L114] EXPR (((! (last_1_var_1_14 >= last_1_var_1_9)) ? ((((*(var_1_4_Pointer)) || (*(var_1_5_Pointer))) && (*(var_1_6_Pointer))) ? ((*(var_1_1_Pointer)) == ((signed long int) ((((last_1_var_1_9) < (last_1_var_1_14)) ? (last_1_var_1_9) : (last_1_var_1_14))))) : ((*(var_1_1_Pointer)) == ((signed long int) last_1_var_1_14))) : ((*(var_1_1_Pointer)) == ((signed long int) last_1_var_1_14))) && (((*(var_1_5_Pointer)) && (*(var_1_4_Pointer))) ? (((*(var_1_6_Pointer)) || ((*(var_1_14_Pointer)) == (*(var_1_1_Pointer)))) ? ((*(var_1_9_Pointer)) == ((signed char) (((((*(var_1_10_Pointer))) < ((*(var_1_11_Pointer)))) ? ((*(var_1_10_Pointer))) : ((*(var_1_11_Pointer))))))) : 1) : ((*(var_1_9_Pointer)) == ((signed char) ((*(var_1_12_Pointer)) - (*(var_1_13_Pointer))))))) && (((*(var_1_12_Pointer)) < (((*(var_1_15_Pointer)) + (*(var_1_16_Pointer))) - ((((64) > ((*(var_1_13_Pointer)))) ? (64) : ((*(var_1_13_Pointer))))))) ? ((*(var_1_14_Pointer)) == ((signed char) ((64 - (*(var_1_16_Pointer))) - (*(var_1_13_Pointer))))) : ((*(var_1_14_Pointer)) == ((signed char) (((((*(var_1_10_Pointer))) < ((*(var_1_11_Pointer)))) ? ((*(var_1_10_Pointer))) : ((*(var_1_11_Pointer)))))))) [L114] EXPR \read(*var_1_12_Pointer) [L114] EXPR \read(*var_1_15_Pointer) [L114] EXPR \read(*var_1_16_Pointer) [L114] EXPR \read(*var_1_13_Pointer) VAL [isInitial=1, last_1_var_1_14=-64, last_1_var_1_9=64, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_11={10:0}, var_1_11_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_13={12:0}, var_1_13_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L114] EXPR ((64) > ((*(var_1_13_Pointer)))) ? (64) : ((*(var_1_13_Pointer))) [L114] EXPR \read(*var_1_13_Pointer) [L114] EXPR ((64) > ((*(var_1_13_Pointer)))) ? (64) : ((*(var_1_13_Pointer))) VAL [isInitial=1, last_1_var_1_14=-64, last_1_var_1_9=64, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_11={10:0}, var_1_11_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_13={12:0}, var_1_13_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L114] EXPR ((*(var_1_12_Pointer)) < (((*(var_1_15_Pointer)) + (*(var_1_16_Pointer))) - ((((64) > ((*(var_1_13_Pointer)))) ? (64) : ((*(var_1_13_Pointer))))))) ? ((*(var_1_14_Pointer)) == ((signed char) ((64 - (*(var_1_16_Pointer))) - (*(var_1_13_Pointer))))) : ((*(var_1_14_Pointer)) == ((signed char) (((((*(var_1_10_Pointer))) < ((*(var_1_11_Pointer)))) ? ((*(var_1_10_Pointer))) : ((*(var_1_11_Pointer))))))) [L114] EXPR \read(*var_1_14_Pointer) [L114] EXPR \read(*var_1_16_Pointer) [L114] EXPR \read(*var_1_13_Pointer) [L114] EXPR ((*(var_1_12_Pointer)) < (((*(var_1_15_Pointer)) + (*(var_1_16_Pointer))) - ((((64) > ((*(var_1_13_Pointer)))) ? (64) : ((*(var_1_13_Pointer))))))) ? ((*(var_1_14_Pointer)) == ((signed char) ((64 - (*(var_1_16_Pointer))) - (*(var_1_13_Pointer))))) : ((*(var_1_14_Pointer)) == ((signed char) (((((*(var_1_10_Pointer))) < ((*(var_1_11_Pointer)))) ? ((*(var_1_10_Pointer))) : ((*(var_1_11_Pointer))))))) VAL [isInitial=1, last_1_var_1_14=-64, last_1_var_1_9=64, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_11={10:0}, var_1_11_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_13={12:0}, var_1_13_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L114] EXPR (((! (last_1_var_1_14 >= last_1_var_1_9)) ? ((((*(var_1_4_Pointer)) || (*(var_1_5_Pointer))) && (*(var_1_6_Pointer))) ? ((*(var_1_1_Pointer)) == ((signed long int) ((((last_1_var_1_9) < (last_1_var_1_14)) ? (last_1_var_1_9) : (last_1_var_1_14))))) : ((*(var_1_1_Pointer)) == ((signed long int) last_1_var_1_14))) : ((*(var_1_1_Pointer)) == ((signed long int) last_1_var_1_14))) && (((*(var_1_5_Pointer)) && (*(var_1_4_Pointer))) ? (((*(var_1_6_Pointer)) || ((*(var_1_14_Pointer)) == (*(var_1_1_Pointer)))) ? ((*(var_1_9_Pointer)) == ((signed char) (((((*(var_1_10_Pointer))) < ((*(var_1_11_Pointer)))) ? ((*(var_1_10_Pointer))) : ((*(var_1_11_Pointer))))))) : 1) : ((*(var_1_9_Pointer)) == ((signed char) ((*(var_1_12_Pointer)) - (*(var_1_13_Pointer))))))) && (((*(var_1_12_Pointer)) < (((*(var_1_15_Pointer)) + (*(var_1_16_Pointer))) - ((((64) > ((*(var_1_13_Pointer)))) ? (64) : ((*(var_1_13_Pointer))))))) ? ((*(var_1_14_Pointer)) == ((signed char) ((64 - (*(var_1_16_Pointer))) - (*(var_1_13_Pointer))))) : ((*(var_1_14_Pointer)) == ((signed char) (((((*(var_1_10_Pointer))) < ((*(var_1_11_Pointer)))) ? ((*(var_1_10_Pointer))) : ((*(var_1_11_Pointer)))))))) VAL [isInitial=1, last_1_var_1_14=-64, last_1_var_1_9=64, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_11={10:0}, var_1_11_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_13={12:0}, var_1_13_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L114] EXPR ((((! (last_1_var_1_14 >= last_1_var_1_9)) ? ((((*(var_1_4_Pointer)) || (*(var_1_5_Pointer))) && (*(var_1_6_Pointer))) ? ((*(var_1_1_Pointer)) == ((signed long int) ((((last_1_var_1_9) < (last_1_var_1_14)) ? (last_1_var_1_9) : (last_1_var_1_14))))) : ((*(var_1_1_Pointer)) == ((signed long int) last_1_var_1_14))) : ((*(var_1_1_Pointer)) == ((signed long int) last_1_var_1_14))) && (((*(var_1_5_Pointer)) && (*(var_1_4_Pointer))) ? (((*(var_1_6_Pointer)) || ((*(var_1_14_Pointer)) == (*(var_1_1_Pointer)))) ? ((*(var_1_9_Pointer)) == ((signed char) (((((*(var_1_10_Pointer))) < ((*(var_1_11_Pointer)))) ? ((*(var_1_10_Pointer))) : ((*(var_1_11_Pointer))))))) : 1) : ((*(var_1_9_Pointer)) == ((signed char) ((*(var_1_12_Pointer)) - (*(var_1_13_Pointer))))))) && (((*(var_1_12_Pointer)) < (((*(var_1_15_Pointer)) + (*(var_1_16_Pointer))) - ((((64) > ((*(var_1_13_Pointer)))) ? (64) : ((*(var_1_13_Pointer))))))) ? ((*(var_1_14_Pointer)) == ((signed char) ((64 - (*(var_1_16_Pointer))) - (*(var_1_13_Pointer))))) : ((*(var_1_14_Pointer)) == ((signed char) (((((*(var_1_10_Pointer))) < ((*(var_1_11_Pointer)))) ? ((*(var_1_10_Pointer))) : ((*(var_1_11_Pointer))))))))) && ((*(var_1_17_Pointer)) == ((float) 128.91f)) VAL [isInitial=1, last_1_var_1_14=-64, last_1_var_1_9=64, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_11={10:0}, var_1_11_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_13={12:0}, var_1_13_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L114] EXPR ((((! (last_1_var_1_14 >= last_1_var_1_9)) ? ((((*(var_1_4_Pointer)) || (*(var_1_5_Pointer))) && (*(var_1_6_Pointer))) ? ((*(var_1_1_Pointer)) == ((signed long int) ((((last_1_var_1_9) < (last_1_var_1_14)) ? (last_1_var_1_9) : (last_1_var_1_14))))) : ((*(var_1_1_Pointer)) == ((signed long int) last_1_var_1_14))) : ((*(var_1_1_Pointer)) == ((signed long int) last_1_var_1_14))) && (((*(var_1_5_Pointer)) && (*(var_1_4_Pointer))) ? (((*(var_1_6_Pointer)) || ((*(var_1_14_Pointer)) == (*(var_1_1_Pointer)))) ? ((*(var_1_9_Pointer)) == ((signed char) (((((*(var_1_10_Pointer))) < ((*(var_1_11_Pointer)))) ? ((*(var_1_10_Pointer))) : ((*(var_1_11_Pointer))))))) : 1) : ((*(var_1_9_Pointer)) == ((signed char) ((*(var_1_12_Pointer)) - (*(var_1_13_Pointer))))))) && (((*(var_1_12_Pointer)) < (((*(var_1_15_Pointer)) + (*(var_1_16_Pointer))) - ((((64) > ((*(var_1_13_Pointer)))) ? (64) : ((*(var_1_13_Pointer))))))) ? ((*(var_1_14_Pointer)) == ((signed char) ((64 - (*(var_1_16_Pointer))) - (*(var_1_13_Pointer))))) : ((*(var_1_14_Pointer)) == ((signed char) (((((*(var_1_10_Pointer))) < ((*(var_1_11_Pointer)))) ? ((*(var_1_10_Pointer))) : ((*(var_1_11_Pointer))))))))) && ((*(var_1_17_Pointer)) == ((float) 128.91f)) [L114] EXPR \read(*var_1_17_Pointer) [L114] EXPR ((((! (last_1_var_1_14 >= last_1_var_1_9)) ? ((((*(var_1_4_Pointer)) || (*(var_1_5_Pointer))) && (*(var_1_6_Pointer))) ? ((*(var_1_1_Pointer)) == ((signed long int) ((((last_1_var_1_9) < (last_1_var_1_14)) ? (last_1_var_1_9) : (last_1_var_1_14))))) : ((*(var_1_1_Pointer)) == ((signed long int) last_1_var_1_14))) : ((*(var_1_1_Pointer)) == ((signed long int) last_1_var_1_14))) && (((*(var_1_5_Pointer)) && (*(var_1_4_Pointer))) ? (((*(var_1_6_Pointer)) || ((*(var_1_14_Pointer)) == (*(var_1_1_Pointer)))) ? ((*(var_1_9_Pointer)) == ((signed char) (((((*(var_1_10_Pointer))) < ((*(var_1_11_Pointer)))) ? ((*(var_1_10_Pointer))) : ((*(var_1_11_Pointer))))))) : 1) : ((*(var_1_9_Pointer)) == ((signed char) ((*(var_1_12_Pointer)) - (*(var_1_13_Pointer))))))) && (((*(var_1_12_Pointer)) < (((*(var_1_15_Pointer)) + (*(var_1_16_Pointer))) - ((((64) > ((*(var_1_13_Pointer)))) ? (64) : ((*(var_1_13_Pointer))))))) ? ((*(var_1_14_Pointer)) == ((signed char) ((64 - (*(var_1_16_Pointer))) - (*(var_1_13_Pointer))))) : ((*(var_1_14_Pointer)) == ((signed char) (((((*(var_1_10_Pointer))) < ((*(var_1_11_Pointer)))) ? ((*(var_1_10_Pointer))) : ((*(var_1_11_Pointer))))))))) && ((*(var_1_17_Pointer)) == ((float) 128.91f)) VAL [isInitial=1, last_1_var_1_14=-64, last_1_var_1_9=64, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_11={10:0}, var_1_11_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_13={12:0}, var_1_13_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L114-L115] return ((((! (last_1_var_1_14 >= last_1_var_1_9)) ? ((((*(var_1_4_Pointer)) || (*(var_1_5_Pointer))) && (*(var_1_6_Pointer))) ? ((*(var_1_1_Pointer)) == ((signed long int) ((((last_1_var_1_9) < (last_1_var_1_14)) ? (last_1_var_1_9) : (last_1_var_1_14))))) : ((*(var_1_1_Pointer)) == ((signed long int) last_1_var_1_14))) : ((*(var_1_1_Pointer)) == ((signed long int) last_1_var_1_14))) && (((*(var_1_5_Pointer)) && (*(var_1_4_Pointer))) ? (((*(var_1_6_Pointer)) || ((*(var_1_14_Pointer)) == (*(var_1_1_Pointer)))) ? ((*(var_1_9_Pointer)) == ((signed char) (((((*(var_1_10_Pointer))) < ((*(var_1_11_Pointer)))) ? ((*(var_1_10_Pointer))) : ((*(var_1_11_Pointer))))))) : 1) : ((*(var_1_9_Pointer)) == ((signed char) ((*(var_1_12_Pointer)) - (*(var_1_13_Pointer))))))) && (((*(var_1_12_Pointer)) < (((*(var_1_15_Pointer)) + (*(var_1_16_Pointer))) - ((((64) > ((*(var_1_13_Pointer)))) ? (64) : ((*(var_1_13_Pointer))))))) ? ((*(var_1_14_Pointer)) == ((signed char) ((64 - (*(var_1_16_Pointer))) - (*(var_1_13_Pointer))))) : ((*(var_1_14_Pointer)) == ((signed char) (((((*(var_1_10_Pointer))) < ((*(var_1_11_Pointer)))) ? ((*(var_1_10_Pointer))) : ((*(var_1_11_Pointer))))))))) && ((*(var_1_17_Pointer)) == ((float) 128.91f)) ; [L124] RET, EXPR property() [L124] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_14=-64, last_1_var_1_9=64, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_11={10:0}, var_1_11_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_13={12:0}, var_1_13_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] [L19] reach_error() VAL [isInitial=1, last_1_var_1_14=-64, last_1_var_1_9=64, var_1_10={9:0}, var_1_10_Pointer={9:0}, var_1_11={10:0}, var_1_11_Pointer={10:0}, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_13={12:0}, var_1_13_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_15={14:0}, var_1_15_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_9={8:0}, var_1_9_Pointer={8:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 96 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 16.9s, OverallIterations: 18, TraceHistogramMax: 18, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 1.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1123 SdHoareTripleChecker+Valid, 0.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1123 mSDsluCounter, 8449 SdHoareTripleChecker+Invalid, 0.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 5916 mSDsCounter, 72 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 695 IncrementalHoareTripleChecker+Invalid, 767 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 72 mSolverCounterUnsat, 2533 mSDtfsCounter, 695 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 698 GetRequests, 576 SyntacticMatches, 0 SemanticMatches, 122 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 729 ImplicationChecksByTransitivity, 2.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=937occurred in iteration=17, InterpolantAutomatonStates: 87, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.5s AutomataMinimizationTime, 17 MinimizatonAttempts, 440 StatesRemovedByMinimization, 15 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 11.3s InterpolantComputationTime, 2983 NumberOfCodeBlocks, 2983 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 2959 ConstructedInterpolants, 0 QuantifiedInterpolants, 11618 SizeOfPredicates, 28 NumberOfNonLiveVariables, 1845 ConjunctsInSsa, 86 ConjunctsInUnsatCore, 21 InterpolantComputations, 17 PerfectInterpolantSequences, 12298/12852 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:48:53,498 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-p_file-57.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 3d3457578c17fc1bdee00c1562f84acead0e6ee0268003a332891d4353885ff1 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 15:48:55,924 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 15:48:56,055 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:48:56,064 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 15:48:56,064 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 15:48:56,093 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 15:48:56,095 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 15:48:56,096 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 15:48:56,096 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 15:48:56,097 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 15:48:56,097 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 15:48:56,097 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 15:48:56,097 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 15:48:56,098 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 15:48:56,098 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 15:48:56,098 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 15:48:56,099 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 15:48:56,099 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 15:48:56,099 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 15:48:56,099 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 15:48:56,099 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 15:48:56,099 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 15:48:56,100 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 15:48:56,100 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-01-09 15:48:56,100 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-01-09 15:48:56,100 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-01-09 15:48:56,100 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 15:48:56,100 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 15:48:56,100 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 15:48:56,100 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 15:48:56,100 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 15:48:56,101 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 15:48:56,101 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 15:48:56,101 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 15:48:56,101 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 15:48:56,101 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 15:48:56,102 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 15:48:56,102 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 15:48:56,102 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 15:48:56,102 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 15:48:56,102 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 15:48:56,102 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 15:48:56,102 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 15:48:56,102 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 15:48:56,102 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-01-09 15:48:56,102 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-01-09 15:48:56,102 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 15:48:56,102 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 15:48:56,102 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 15:48:56,102 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 15:48:56,103 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 -> 3d3457578c17fc1bdee00c1562f84acead0e6ee0268003a332891d4353885ff1 [2025-01-09 15:48:56,409 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 15:48:56,417 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 15:48:56,421 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 15:48:56,423 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 15:48:56,423 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 15:48:56,424 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-p_file-57.i [2025-01-09 15:48:57,735 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/244477f5d/891dd29d987e44e3ba3ed5fc98152839/FLAGe7e054e64 [2025-01-09 15:48:57,993 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 15:48:57,993 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-57.i [2025-01-09 15:48:58,003 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/244477f5d/891dd29d987e44e3ba3ed5fc98152839/FLAGe7e054e64 [2025-01-09 15:48:58,021 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/244477f5d/891dd29d987e44e3ba3ed5fc98152839 [2025-01-09 15:48:58,025 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 15:48:58,026 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 15:48:58,029 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 15:48:58,030 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 15:48:58,034 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 15:48:58,035 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 03:48:58" (1/1) ... [2025-01-09 15:48:58,037 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@cb27fab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:48:58, skipping insertion in model container [2025-01-09 15:48:58,037 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 03:48:58" (1/1) ... [2025-01-09 15:48:58,056 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 15:48:58,190 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-p_file-57.i[916,929] [2025-01-09 15:48:58,262 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 15:48:58,285 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 15:48:58,297 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-p_file-57.i[916,929] [2025-01-09 15:48:58,332 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 15:48:58,353 INFO L204 MainTranslator]: Completed translation [2025-01-09 15:48:58,354 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:48:58 WrapperNode [2025-01-09 15:48:58,354 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 15:48:58,355 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 15:48:58,355 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 15:48:58,355 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 15:48:58,360 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:48:58" (1/1) ... [2025-01-09 15:48:58,371 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:48:58" (1/1) ... [2025-01-09 15:48:58,417 INFO L138 Inliner]: procedures = 33, calls = 152, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 440 [2025-01-09 15:48:58,418 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 15:48:58,419 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 15:48:58,419 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 15:48:58,420 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 15:48:58,427 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:48:58" (1/1) ... [2025-01-09 15:48:58,427 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:48:58" (1/1) ... [2025-01-09 15:48:58,435 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:48:58" (1/1) ... [2025-01-09 15:48:58,470 INFO L175 MemorySlicer]: Split 110 memory accesses to 14 slices as follows [2, 9, 8, 8, 8, 6, 12, 12, 8, 12, 8, 6, 8, 3]. 11 percent of accesses are in the largest equivalence class. The 15 initializations are split as follows [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]. The 17 writes are split as follows [0, 3, 1, 1, 1, 2, 1, 1, 1, 1, 2, 1, 1, 1]. [2025-01-09 15:48:58,470 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:48:58" (1/1) ... [2025-01-09 15:48:58,471 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:48:58" (1/1) ... [2025-01-09 15:48:58,504 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:48:58" (1/1) ... [2025-01-09 15:48:58,506 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:48:58" (1/1) ... [2025-01-09 15:48:58,509 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:48:58" (1/1) ... [2025-01-09 15:48:58,514 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:48:58" (1/1) ... [2025-01-09 15:48:58,519 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:48:58" (1/1) ... [2025-01-09 15:48:58,527 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 15:48:58,528 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 15:48:58,528 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 15:48:58,528 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 15:48:58,529 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:48:58" (1/1) ... [2025-01-09 15:48:58,535 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 15:48:58,547 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 15:48:58,561 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:48:58,569 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:48:58,589 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 15:48:58,589 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2025-01-09 15:48:58,590 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2025-01-09 15:48:58,590 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2025-01-09 15:48:58,590 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#3 [2025-01-09 15:48:58,590 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#4 [2025-01-09 15:48:58,590 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#5 [2025-01-09 15:48:58,590 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#6 [2025-01-09 15:48:58,590 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#7 [2025-01-09 15:48:58,590 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#8 [2025-01-09 15:48:58,590 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#9 [2025-01-09 15:48:58,591 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#10 [2025-01-09 15:48:58,591 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#11 [2025-01-09 15:48:58,591 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#12 [2025-01-09 15:48:58,592 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#13 [2025-01-09 15:48:58,592 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-01-09 15:48:58,592 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2025-01-09 15:48:58,592 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2025-01-09 15:48:58,592 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#3 [2025-01-09 15:48:58,592 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#4 [2025-01-09 15:48:58,593 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#5 [2025-01-09 15:48:58,593 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#6 [2025-01-09 15:48:58,594 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#7 [2025-01-09 15:48:58,594 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#8 [2025-01-09 15:48:58,594 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#9 [2025-01-09 15:48:58,594 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#10 [2025-01-09 15:48:58,594 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#11 [2025-01-09 15:48:58,594 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#12 [2025-01-09 15:48:58,594 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#13 [2025-01-09 15:48:58,594 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#0 [2025-01-09 15:48:58,594 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#1 [2025-01-09 15:48:58,594 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#2 [2025-01-09 15:48:58,594 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#3 [2025-01-09 15:48:58,595 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#4 [2025-01-09 15:48:58,595 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#5 [2025-01-09 15:48:58,595 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#6 [2025-01-09 15:48:58,595 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#7 [2025-01-09 15:48:58,595 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#8 [2025-01-09 15:48:58,595 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#9 [2025-01-09 15:48:58,597 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#10 [2025-01-09 15:48:58,597 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#11 [2025-01-09 15:48:58,598 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#12 [2025-01-09 15:48:58,598 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#13 [2025-01-09 15:48:58,598 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#0 [2025-01-09 15:48:58,598 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#1 [2025-01-09 15:48:58,598 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#2 [2025-01-09 15:48:58,598 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#3 [2025-01-09 15:48:58,598 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#4 [2025-01-09 15:48:58,598 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#5 [2025-01-09 15:48:58,598 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#6 [2025-01-09 15:48:58,598 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#7 [2025-01-09 15:48:58,598 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#8 [2025-01-09 15:48:58,598 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#9 [2025-01-09 15:48:58,598 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#10 [2025-01-09 15:48:58,598 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#11 [2025-01-09 15:48:58,598 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#12 [2025-01-09 15:48:58,598 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#13 [2025-01-09 15:48:58,598 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2025-01-09 15:48:58,598 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2025-01-09 15:48:58,598 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2025-01-09 15:48:58,598 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#3 [2025-01-09 15:48:58,599 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#4 [2025-01-09 15:48:58,599 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#5 [2025-01-09 15:48:58,599 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#6 [2025-01-09 15:48:58,599 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#7 [2025-01-09 15:48:58,599 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#8 [2025-01-09 15:48:58,599 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#9 [2025-01-09 15:48:58,599 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#10 [2025-01-09 15:48:58,599 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#11 [2025-01-09 15:48:58,599 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#12 [2025-01-09 15:48:58,599 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#13 [2025-01-09 15:48:58,600 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#0 [2025-01-09 15:48:58,600 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#1 [2025-01-09 15:48:58,600 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#2 [2025-01-09 15:48:58,600 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#3 [2025-01-09 15:48:58,600 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#4 [2025-01-09 15:48:58,600 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#5 [2025-01-09 15:48:58,600 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#6 [2025-01-09 15:48:58,600 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#7 [2025-01-09 15:48:58,600 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#8 [2025-01-09 15:48:58,600 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#9 [2025-01-09 15:48:58,600 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#10 [2025-01-09 15:48:58,600 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#11 [2025-01-09 15:48:58,601 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#12 [2025-01-09 15:48:58,602 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#13 [2025-01-09 15:48:58,602 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#0 [2025-01-09 15:48:58,602 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#1 [2025-01-09 15:48:58,602 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#2 [2025-01-09 15:48:58,602 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#3 [2025-01-09 15:48:58,602 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#4 [2025-01-09 15:48:58,602 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#5 [2025-01-09 15:48:58,602 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#6 [2025-01-09 15:48:58,602 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#7 [2025-01-09 15:48:58,602 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#8 [2025-01-09 15:48:58,602 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#9 [2025-01-09 15:48:58,603 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#10 [2025-01-09 15:48:58,603 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#11 [2025-01-09 15:48:58,603 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#12 [2025-01-09 15:48:58,603 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#13 [2025-01-09 15:48:58,603 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 15:48:58,603 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 15:48:58,603 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 15:48:58,603 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 15:48:58,603 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2025-01-09 15:48:58,603 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2025-01-09 15:48:58,603 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#2 [2025-01-09 15:48:58,603 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#3 [2025-01-09 15:48:58,603 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#4 [2025-01-09 15:48:58,603 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#5 [2025-01-09 15:48:58,603 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#6 [2025-01-09 15:48:58,603 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#7 [2025-01-09 15:48:58,603 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#8 [2025-01-09 15:48:58,603 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#9 [2025-01-09 15:48:58,603 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#10 [2025-01-09 15:48:58,603 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#11 [2025-01-09 15:48:58,603 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#12 [2025-01-09 15:48:58,603 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#13 [2025-01-09 15:48:58,603 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2025-01-09 15:48:58,604 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2025-01-09 15:48:58,604 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2025-01-09 15:48:58,604 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#3 [2025-01-09 15:48:58,604 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#4 [2025-01-09 15:48:58,604 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#5 [2025-01-09 15:48:58,604 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#6 [2025-01-09 15:48:58,604 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#7 [2025-01-09 15:48:58,604 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#8 [2025-01-09 15:48:58,604 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#9 [2025-01-09 15:48:58,604 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#10 [2025-01-09 15:48:58,604 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#11 [2025-01-09 15:48:58,604 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#12 [2025-01-09 15:48:58,604 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#13 [2025-01-09 15:48:58,859 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 15:48:58,861 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 15:48:59,414 INFO L? ?]: Removed 94 outVars from TransFormulas that were not future-live. [2025-01-09 15:48:59,414 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 15:48:59,423 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 15:48:59,424 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 15:48:59,424 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 03:48:59 BoogieIcfgContainer [2025-01-09 15:48:59,424 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 15:48:59,426 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 15:48:59,426 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 15:48:59,431 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 15:48:59,431 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 03:48:58" (1/3) ... [2025-01-09 15:48:59,432 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5243a456 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 03:48:59, skipping insertion in model container [2025-01-09 15:48:59,432 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:48:58" (2/3) ... [2025-01-09 15:48:59,432 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5243a456 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 03:48:59, skipping insertion in model container [2025-01-09 15:48:59,432 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 03:48:59" (3/3) ... [2025-01-09 15:48:59,433 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-p_file-57.i [2025-01-09 15:48:59,447 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 15:48:59,449 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-p_file-57.i that has 2 procedures, 96 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 15:48:59,508 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 15:48:59,519 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;@33513d59, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 15:48:59,519 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 15:48:59,522 INFO L276 IsEmpty]: Start isEmpty. Operand has 96 states, 75 states have (on average 1.3866666666666667) internal successors, (104), 76 states have internal predecessors, (104), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-01-09 15:48:59,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2025-01-09 15:48:59,533 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:48:59,533 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:48:59,533 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:48:59,537 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:48:59,538 INFO L85 PathProgramCache]: Analyzing trace with hash -827950772, now seen corresponding path program 1 times [2025-01-09 15:48:59,546 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 15:48:59,546 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1571405386] [2025-01-09 15:48:59,546 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:48:59,547 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:48:59,547 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 15:48:59,552 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:48:59,553 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:48:59,794 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 134 statements into 1 equivalence classes. [2025-01-09 15:48:59,908 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 134 of 134 statements. [2025-01-09 15:48:59,908 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:48:59,909 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:48:59,916 INFO L256 TraceCheckSpWp]: Trace formula consists of 333 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 15:48:59,931 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 15:48:59,966 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 322 proven. 0 refuted. 0 times theorem prover too weak. 290 trivial. 0 not checked. [2025-01-09 15:48:59,966 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 15:48:59,967 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 15:48:59,967 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1571405386] [2025-01-09 15:48:59,968 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1571405386] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:48:59,968 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:48:59,968 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 15:48:59,969 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1007528647] [2025-01-09 15:48:59,970 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:48:59,973 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 15:48:59,974 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 15:48:59,992 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 15:48:59,992 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 15:48:59,995 INFO L87 Difference]: Start difference. First operand has 96 states, 75 states have (on average 1.3866666666666667) internal successors, (104), 76 states have internal predecessors, (104), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) Second operand has 2 states, 2 states have (on average 25.5) internal successors, (51), 2 states have internal predecessors, (51), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-01-09 15:49:00,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:49:00,027 INFO L93 Difference]: Finished difference Result 186 states and 293 transitions. [2025-01-09 15:49:00,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 15:49:00,029 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 25.5) internal successors, (51), 2 states have internal predecessors, (51), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 134 [2025-01-09 15:49:00,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:49:00,034 INFO L225 Difference]: With dead ends: 186 [2025-01-09 15:49:00,034 INFO L226 Difference]: Without dead ends: 93 [2025-01-09 15:49:00,036 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 133 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:49:00,038 INFO L435 NwaCegarLoop]: 135 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, 135 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:49:00,039 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 135 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 15:49:00,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2025-01-09 15:49:00,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2025-01-09 15:49:00,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 73 states have (on average 1.356164383561644) internal successors, (99), 73 states have internal predecessors, (99), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-01-09 15:49:00,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 135 transitions. [2025-01-09 15:49:00,072 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 135 transitions. Word has length 134 [2025-01-09 15:49:00,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:49:00,073 INFO L471 AbstractCegarLoop]: Abstraction has 93 states and 135 transitions. [2025-01-09 15:49:00,073 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 25.5) internal successors, (51), 2 states have internal predecessors, (51), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-01-09 15:49:00,073 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 135 transitions. [2025-01-09 15:49:00,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2025-01-09 15:49:00,075 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:49:00,076 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:49:00,081 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:49:00,276 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:49:00,276 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:49:00,277 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:49:00,277 INFO L85 PathProgramCache]: Analyzing trace with hash 669687792, now seen corresponding path program 1 times [2025-01-09 15:49:00,278 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 15:49:00,278 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [348393310] [2025-01-09 15:49:00,278 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:49:00,278 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 15:49:00,278 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 15:49:00,280 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:49:00,281 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:49:00,470 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 134 statements into 1 equivalence classes. [2025-01-09 15:49:00,587 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 134 of 134 statements. [2025-01-09 15:49:00,587 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:49:00,587 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:49:00,594 INFO L256 TraceCheckSpWp]: Trace formula consists of 333 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-01-09 15:49:00,601 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 15:49:00,708 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2025-01-09 15:49:00,715 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2025-01-09 15:49:01,338 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-01-09 15:49:01,339 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 15:49:01,339 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 15:49:01,339 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [348393310] [2025-01-09 15:49:01,339 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [348393310] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:49:01,339 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:49:01,339 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 15:49:01,339 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1612575876] [2025-01-09 15:49:01,339 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:49:01,340 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 15:49:01,340 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 15:49:01,342 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 15:49:01,342 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 15:49:01,342 INFO L87 Difference]: Start difference. First operand 93 states and 135 transitions. Second operand has 4 states, 4 states have (on average 11.75) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-01-09 15:49:01,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:49:01,545 INFO L93 Difference]: Finished difference Result 274 states and 400 transitions. [2025-01-09 15:49:01,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 15:49:01,546 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 134 [2025-01-09 15:49:01,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:49:01,549 INFO L225 Difference]: With dead ends: 274 [2025-01-09 15:49:01,549 INFO L226 Difference]: Without dead ends: 184 [2025-01-09 15:49:01,550 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 131 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 15:49:01,551 INFO L435 NwaCegarLoop]: 126 mSDtfsCounter, 100 mSDsluCounter, 241 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 367 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 15:49:01,551 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 367 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 15:49:01,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2025-01-09 15:49:01,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 153. [2025-01-09 15:49:01,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 153 states, 114 states have (on average 1.3070175438596492) internal successors, (149), 114 states have internal predecessors, (149), 36 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2025-01-09 15:49:01,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 221 transitions. [2025-01-09 15:49:01,589 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 221 transitions. Word has length 134 [2025-01-09 15:49:01,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:49:01,590 INFO L471 AbstractCegarLoop]: Abstraction has 153 states and 221 transitions. [2025-01-09 15:49:01,591 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-01-09 15:49:01,591 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 221 transitions. [2025-01-09 15:49:01,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2025-01-09 15:49:01,593 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:49:01,593 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:49:01,601 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2025-01-09 15:49:01,798 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:49:01,798 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:49:01,799 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:49:01,799 INFO L85 PathProgramCache]: Analyzing trace with hash 1024583439, now seen corresponding path program 1 times [2025-01-09 15:49:01,800 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 15:49:01,800 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1474192733] [2025-01-09 15:49:01,800 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:49:01,800 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 15:49:01,800 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 15:49:01,802 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:49:01,804 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:49:01,982 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 141 statements into 1 equivalence classes. [2025-01-09 15:49:02,099 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 141 of 141 statements. [2025-01-09 15:49:02,099 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:49:02,099 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:49:02,105 INFO L256 TraceCheckSpWp]: Trace formula consists of 349 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-01-09 15:49:02,111 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 15:49:02,491 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 16 proven. 116 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-01-09 15:49:02,491 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 15:49:02,624 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-01-09 15:49:02,624 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 15:49:02,624 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1474192733] [2025-01-09 15:49:02,624 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1474192733] provided 1 perfect and 1 imperfect interpolant sequences [2025-01-09 15:49:02,624 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 15:49:02,624 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [10] total 11 [2025-01-09 15:49:02,625 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1499870699] [2025-01-09 15:49:02,625 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:49:02,625 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 15:49:02,625 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 15:49:02,626 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 15:49:02,626 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2025-01-09 15:49:02,627 INFO L87 Difference]: Start difference. First operand 153 states and 221 transitions. Second operand has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-01-09 15:49:02,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:49:02,709 INFO L93 Difference]: Finished difference Result 305 states and 446 transitions. [2025-01-09 15:49:02,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 15:49:02,710 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 141 [2025-01-09 15:49:02,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:49:02,711 INFO L225 Difference]: With dead ends: 305 [2025-01-09 15:49:02,712 INFO L226 Difference]: Without dead ends: 215 [2025-01-09 15:49:02,712 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 281 GetRequests, 271 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2025-01-09 15:49:02,715 INFO L435 NwaCegarLoop]: 129 mSDtfsCounter, 62 mSDsluCounter, 366 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 495 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 15:49:02,715 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 495 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 15:49:02,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2025-01-09 15:49:02,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 184. [2025-01-09 15:49:02,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 184 states, 145 states have (on average 1.3586206896551725) internal successors, (197), 145 states have internal predecessors, (197), 36 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2025-01-09 15:49:02,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 269 transitions. [2025-01-09 15:49:02,740 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 269 transitions. Word has length 141 [2025-01-09 15:49:02,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:49:02,741 INFO L471 AbstractCegarLoop]: Abstraction has 184 states and 269 transitions. [2025-01-09 15:49:02,741 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-01-09 15:49:02,741 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 269 transitions. [2025-01-09 15:49:02,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2025-01-09 15:49:02,743 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:49:02,743 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:49:02,750 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:49:02,943 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:49:02,944 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:49:02,944 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:49:02,945 INFO L85 PathProgramCache]: Analyzing trace with hash -255280239, now seen corresponding path program 1 times [2025-01-09 15:49:02,945 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 15:49:02,945 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1877086986] [2025-01-09 15:49:02,945 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:49:02,945 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:49:02,946 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 15:49:02,952 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:49:02,954 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:49:03,110 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 141 statements into 1 equivalence classes. [2025-01-09 15:49:03,211 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 141 of 141 statements. [2025-01-09 15:49:03,211 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:49:03,211 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:49:03,216 INFO L256 TraceCheckSpWp]: Trace formula consists of 351 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-01-09 15:49:03,224 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 15:49:03,259 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2025-01-09 15:49:03,264 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2025-01-09 15:49:03,721 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 45 treesize of output 32 [2025-01-09 15:49:03,725 WARN L214 Elim1Store]: Array PQE input equivalent to false [2025-01-09 15:49:03,730 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 9 treesize of output 8 [2025-01-09 15:49:03,885 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 91 treesize of output 79 [2025-01-09 15:49:03,919 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-01-09 15:49:03,919 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 15:49:03,919 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 15:49:03,920 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1877086986] [2025-01-09 15:49:03,920 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1877086986] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:49:03,920 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:49:03,920 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 15:49:03,920 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2058667999] [2025-01-09 15:49:03,920 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:49:03,920 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 15:49:03,920 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 15:49:03,921 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 15:49:03,921 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-01-09 15:49:03,921 INFO L87 Difference]: Start difference. First operand 184 states and 269 transitions. Second operand has 8 states, 8 states have (on average 6.75) internal successors, (54), 7 states have internal predecessors, (54), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-01-09 15:49:04,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:49:04,248 INFO L93 Difference]: Finished difference Result 322 states and 472 transitions. [2025-01-09 15:49:04,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 15:49:04,249 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.75) internal successors, (54), 7 states have internal predecessors, (54), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 141 [2025-01-09 15:49:04,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:49:04,251 INFO L225 Difference]: With dead ends: 322 [2025-01-09 15:49:04,251 INFO L226 Difference]: Without dead ends: 216 [2025-01-09 15:49:04,251 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 134 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2025-01-09 15:49:04,252 INFO L435 NwaCegarLoop]: 122 mSDtfsCounter, 144 mSDsluCounter, 618 mSDsCounter, 0 mSdLazyCounter, 134 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 144 SdHoareTripleChecker+Valid, 740 SdHoareTripleChecker+Invalid, 173 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 134 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 15:49:04,252 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [144 Valid, 740 Invalid, 173 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 134 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 15:49:04,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2025-01-09 15:49:04,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 192. [2025-01-09 15:49:04,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 192 states, 153 states have (on average 1.3594771241830066) internal successors, (208), 153 states have internal predecessors, (208), 36 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2025-01-09 15:49:04,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 280 transitions. [2025-01-09 15:49:04,276 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 280 transitions. Word has length 141 [2025-01-09 15:49:04,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:49:04,277 INFO L471 AbstractCegarLoop]: Abstraction has 192 states and 280 transitions. [2025-01-09 15:49:04,277 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.75) internal successors, (54), 7 states have internal predecessors, (54), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-01-09 15:49:04,277 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 280 transitions. [2025-01-09 15:49:04,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2025-01-09 15:49:04,280 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:49:04,280 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:49:04,287 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2025-01-09 15:49:04,480 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 15:49:04,481 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:49:04,481 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:49:04,482 INFO L85 PathProgramCache]: Analyzing trace with hash -632405169, now seen corresponding path program 1 times [2025-01-09 15:49:04,482 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 15:49:04,482 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [832730924] [2025-01-09 15:49:04,482 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:49:04,482 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:49:04,482 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 15:49:04,485 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-01-09 15:49:04,486 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2025-01-09 15:49:04,632 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 144 statements into 1 equivalence classes. [2025-01-09 15:49:04,745 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 144 of 144 statements. [2025-01-09 15:49:04,745 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:49:04,745 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:49:04,756 INFO L256 TraceCheckSpWp]: Trace formula consists of 362 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-09 15:49:04,759 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 15:49:04,787 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-01-09 15:49:04,787 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 15:49:04,787 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 15:49:04,787 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [832730924] [2025-01-09 15:49:04,787 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [832730924] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:49:04,787 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:49:04,788 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 15:49:04,788 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [356596752] [2025-01-09 15:49:04,788 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:49:04,789 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 15:49:04,789 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 15:49:04,789 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 15:49:04,789 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 15:49:04,790 INFO L87 Difference]: Start difference. First operand 192 states and 280 transitions. Second operand has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-01-09 15:49:04,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:49:04,823 INFO L93 Difference]: Finished difference Result 301 states and 441 transitions. [2025-01-09 15:49:04,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 15:49:04,825 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 144 [2025-01-09 15:49:04,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:49:04,827 INFO L225 Difference]: With dead ends: 301 [2025-01-09 15:49:04,827 INFO L226 Difference]: Without dead ends: 195 [2025-01-09 15:49:04,828 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 141 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:49:04,828 INFO L435 NwaCegarLoop]: 132 mSDtfsCounter, 1 mSDsluCounter, 255 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 387 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:49:04,828 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 387 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 15:49:04,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2025-01-09 15:49:04,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 194. [2025-01-09 15:49:04,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 194 states, 155 states have (on average 1.3548387096774193) internal successors, (210), 155 states have internal predecessors, (210), 36 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2025-01-09 15:49:04,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 282 transitions. [2025-01-09 15:49:04,854 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 282 transitions. Word has length 144 [2025-01-09 15:49:04,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:49:04,854 INFO L471 AbstractCegarLoop]: Abstraction has 194 states and 282 transitions. [2025-01-09 15:49:04,854 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-01-09 15:49:04,854 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 282 transitions. [2025-01-09 15:49:04,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2025-01-09 15:49:04,858 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:49:04,858 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:49:04,865 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2025-01-09 15:49:05,058 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 15:49:05,059 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:49:05,059 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:49:05,059 INFO L85 PathProgramCache]: Analyzing trace with hash -630558127, now seen corresponding path program 1 times [2025-01-09 15:49:05,060 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 15:49:05,060 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2101722612] [2025-01-09 15:49:05,060 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:49:05,060 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:49:05,060 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 15:49:05,062 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:49:05,063 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:49:05,190 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 144 statements into 1 equivalence classes. [2025-01-09 15:49:05,284 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 144 of 144 statements. [2025-01-09 15:49:05,285 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:49:05,285 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:49:05,289 INFO L256 TraceCheckSpWp]: Trace formula consists of 360 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-01-09 15:49:05,296 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 15:49:05,997 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 28 treesize of output 24 [2025-01-09 15:49:06,053 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 87 treesize of output 75 [2025-01-09 15:49:06,057 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 75 treesize of output 63 [2025-01-09 15:49:06,060 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 51 [2025-01-09 15:49:06,092 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 368 refuted. 0 times theorem prover too weak. 244 trivial. 0 not checked. [2025-01-09 15:49:06,093 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 15:49:06,260 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-01-09 15:49:06,261 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 15:49:06,261 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2101722612] [2025-01-09 15:49:06,261 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2101722612] provided 1 perfect and 1 imperfect interpolant sequences [2025-01-09 15:49:06,261 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 15:49:06,261 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [8] total 10 [2025-01-09 15:49:06,261 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1267756163] [2025-01-09 15:49:06,261 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:49:06,263 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 15:49:06,263 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 15:49:06,263 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 15:49:06,264 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2025-01-09 15:49:06,264 INFO L87 Difference]: Start difference. First operand 194 states and 282 transitions. Second operand has 6 states, 6 states have (on average 9.5) internal successors, (57), 6 states have internal predecessors, (57), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-01-09 15:49:06,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:49:06,489 INFO L93 Difference]: Finished difference Result 380 states and 548 transitions. [2025-01-09 15:49:06,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 15:49:06,489 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.5) internal successors, (57), 6 states have internal predecessors, (57), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 144 [2025-01-09 15:49:06,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:49:06,492 INFO L225 Difference]: With dead ends: 380 [2025-01-09 15:49:06,493 INFO L226 Difference]: Without dead ends: 272 [2025-01-09 15:49:06,493 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 289 GetRequests, 278 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2025-01-09 15:49:06,495 INFO L435 NwaCegarLoop]: 170 mSDtfsCounter, 74 mSDsluCounter, 604 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 774 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 15:49:06,495 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 774 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 15:49:06,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272 states. [2025-01-09 15:49:06,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 269. [2025-01-09 15:49:06,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 269 states, 219 states have (on average 1.3424657534246576) internal successors, (294), 220 states have internal predecessors, (294), 46 states have call successors, (46), 3 states have call predecessors, (46), 3 states have return successors, (46), 45 states have call predecessors, (46), 46 states have call successors, (46) [2025-01-09 15:49:06,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 269 states and 386 transitions. [2025-01-09 15:49:06,518 INFO L78 Accepts]: Start accepts. Automaton has 269 states and 386 transitions. Word has length 144 [2025-01-09 15:49:06,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:49:06,519 INFO L471 AbstractCegarLoop]: Abstraction has 269 states and 386 transitions. [2025-01-09 15:49:06,519 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.5) internal successors, (57), 6 states have internal predecessors, (57), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-01-09 15:49:06,519 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 386 transitions. [2025-01-09 15:49:06,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2025-01-09 15:49:06,521 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:49:06,521 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:49:06,528 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 (7)] Ended with exit code 0 [2025-01-09 15:49:06,722 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 15:49:06,722 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:49:06,722 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:49:06,723 INFO L85 PathProgramCache]: Analyzing trace with hash -424613025, now seen corresponding path program 1 times [2025-01-09 15:49:06,723 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 15:49:06,723 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [579524772] [2025-01-09 15:49:06,723 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:49:06,723 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:49:06,723 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 15:49:06,727 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-01-09 15:49:06,727 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2025-01-09 15:49:06,855 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 145 statements into 1 equivalence classes. [2025-01-09 15:49:06,948 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 145 of 145 statements. [2025-01-09 15:49:06,948 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:49:06,948 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:49:06,952 INFO L256 TraceCheckSpWp]: Trace formula consists of 360 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-01-09 15:49:06,956 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 15:49:07,241 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 16 proven. 116 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-01-09 15:49:07,241 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 15:49:07,329 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-01-09 15:49:07,330 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 15:49:07,330 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [579524772] [2025-01-09 15:49:07,330 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [579524772] provided 1 perfect and 1 imperfect interpolant sequences [2025-01-09 15:49:07,330 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 15:49:07,330 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [10] total 11 [2025-01-09 15:49:07,330 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1613076174] [2025-01-09 15:49:07,330 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:49:07,330 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 15:49:07,330 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 15:49:07,331 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 15:49:07,331 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2025-01-09 15:49:07,331 INFO L87 Difference]: Start difference. First operand 269 states and 386 transitions. Second operand has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-01-09 15:49:07,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:49:07,396 INFO L93 Difference]: Finished difference Result 490 states and 703 transitions. [2025-01-09 15:49:07,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 15:49:07,397 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 145 [2025-01-09 15:49:07,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:49:07,400 INFO L225 Difference]: With dead ends: 490 [2025-01-09 15:49:07,402 INFO L226 Difference]: Without dead ends: 301 [2025-01-09 15:49:07,402 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 289 GetRequests, 279 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2025-01-09 15:49:07,403 INFO L435 NwaCegarLoop]: 139 mSDtfsCounter, 117 mSDsluCounter, 254 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 393 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 15:49:07,404 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [117 Valid, 393 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 15:49:07,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 301 states. [2025-01-09 15:49:07,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 301 to 259. [2025-01-09 15:49:07,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 259 states, 209 states have (on average 1.325358851674641) internal successors, (277), 210 states have internal predecessors, (277), 46 states have call successors, (46), 3 states have call predecessors, (46), 3 states have return successors, (46), 45 states have call predecessors, (46), 46 states have call successors, (46) [2025-01-09 15:49:07,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259 states to 259 states and 369 transitions. [2025-01-09 15:49:07,430 INFO L78 Accepts]: Start accepts. Automaton has 259 states and 369 transitions. Word has length 145 [2025-01-09 15:49:07,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:49:07,430 INFO L471 AbstractCegarLoop]: Abstraction has 259 states and 369 transitions. [2025-01-09 15:49:07,430 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-01-09 15:49:07,430 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 369 transitions. [2025-01-09 15:49:07,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2025-01-09 15:49:07,433 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:49:07,433 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:49:07,440 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Ended with exit code 0 [2025-01-09 15:49:07,634 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 15:49:07,634 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:49:07,635 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:49:07,635 INFO L85 PathProgramCache]: Analyzing trace with hash 1546899427, now seen corresponding path program 1 times [2025-01-09 15:49:07,635 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 15:49:07,635 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [410549352] [2025-01-09 15:49:07,635 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:49:07,635 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:49:07,635 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 15:49:07,637 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-01-09 15:49:07,638 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2025-01-09 15:49:07,761 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 145 statements into 1 equivalence classes. [2025-01-09 15:49:07,833 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 145 of 145 statements. [2025-01-09 15:49:07,833 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:49:07,833 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:49:07,838 INFO L256 TraceCheckSpWp]: Trace formula consists of 356 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-01-09 15:49:07,840 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 15:49:08,178 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 27 treesize of output 15 [2025-01-09 15:49:08,209 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 12 proven. 296 refuted. 0 times theorem prover too weak. 304 trivial. 0 not checked. [2025-01-09 15:49:08,209 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 15:49:08,340 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-01-09 15:49:08,340 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 15:49:08,340 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [410549352] [2025-01-09 15:49:08,341 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [410549352] provided 1 perfect and 1 imperfect interpolant sequences [2025-01-09 15:49:08,341 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 15:49:08,341 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [10] total 13 [2025-01-09 15:49:08,341 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [301705699] [2025-01-09 15:49:08,341 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:49:08,341 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 15:49:08,341 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 15:49:08,342 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 15:49:08,342 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2025-01-09 15:49:08,342 INFO L87 Difference]: Start difference. First operand 259 states and 369 transitions. Second operand has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-01-09 15:49:08,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:49:08,448 INFO L93 Difference]: Finished difference Result 618 states and 876 transitions. [2025-01-09 15:49:08,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 15:49:08,449 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 145 [2025-01-09 15:49:08,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:49:08,453 INFO L225 Difference]: With dead ends: 618 [2025-01-09 15:49:08,455 INFO L226 Difference]: Without dead ends: 443 [2025-01-09 15:49:08,456 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 289 GetRequests, 277 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2025-01-09 15:49:08,456 INFO L435 NwaCegarLoop]: 140 mSDtfsCounter, 167 mSDsluCounter, 277 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 167 SdHoareTripleChecker+Valid, 417 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 15:49:08,457 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [167 Valid, 417 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 15:49:08,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 443 states. [2025-01-09 15:49:08,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 443 to 424. [2025-01-09 15:49:08,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 424 states, 363 states have (on average 1.3498622589531681) internal successors, (490), 366 states have internal predecessors, (490), 54 states have call successors, (54), 6 states have call predecessors, (54), 6 states have return successors, (54), 51 states have call predecessors, (54), 54 states have call successors, (54) [2025-01-09 15:49:08,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 424 states to 424 states and 598 transitions. [2025-01-09 15:49:08,481 INFO L78 Accepts]: Start accepts. Automaton has 424 states and 598 transitions. Word has length 145 [2025-01-09 15:49:08,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:49:08,482 INFO L471 AbstractCegarLoop]: Abstraction has 424 states and 598 transitions. [2025-01-09 15:49:08,482 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-01-09 15:49:08,482 INFO L276 IsEmpty]: Start isEmpty. Operand 424 states and 598 transitions. [2025-01-09 15:49:08,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2025-01-09 15:49:08,483 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:49:08,483 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:49:08,491 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Ended with exit code 0 [2025-01-09 15:49:08,684 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 15:49:08,684 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:49:08,684 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:49:08,685 INFO L85 PathProgramCache]: Analyzing trace with hash -1361864475, now seen corresponding path program 1 times [2025-01-09 15:49:08,685 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 15:49:08,685 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1393680896] [2025-01-09 15:49:08,685 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:49:08,685 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:49:08,685 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 15:49:08,687 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-01-09 15:49:08,689 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2025-01-09 15:49:08,817 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 145 statements into 1 equivalence classes. [2025-01-09 15:49:08,910 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 145 of 145 statements. [2025-01-09 15:49:08,910 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:49:08,910 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:49:08,915 INFO L256 TraceCheckSpWp]: Trace formula consists of 355 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-01-09 15:49:08,918 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 15:49:09,301 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 12 proven. 296 refuted. 0 times theorem prover too weak. 304 trivial. 0 not checked. [2025-01-09 15:49:09,302 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 15:49:09,430 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-01-09 15:49:09,430 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 15:49:09,430 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1393680896] [2025-01-09 15:49:09,430 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1393680896] provided 1 perfect and 1 imperfect interpolant sequences [2025-01-09 15:49:09,430 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 15:49:09,430 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [11] total 13 [2025-01-09 15:49:09,430 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1892991361] [2025-01-09 15:49:09,430 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:49:09,431 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 15:49:09,431 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 15:49:09,431 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 15:49:09,431 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2025-01-09 15:49:09,432 INFO L87 Difference]: Start difference. First operand 424 states and 598 transitions. Second operand has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 states have internal predecessors, (58), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-01-09 15:49:09,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:49:09,553 INFO L93 Difference]: Finished difference Result 843 states and 1192 transitions. [2025-01-09 15:49:09,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 15:49:09,554 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 states have internal predecessors, (58), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 145 [2025-01-09 15:49:09,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:49:09,560 INFO L225 Difference]: With dead ends: 843 [2025-01-09 15:49:09,560 INFO L226 Difference]: Without dead ends: 547 [2025-01-09 15:49:09,561 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 289 GetRequests, 277 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2025-01-09 15:49:09,562 INFO L435 NwaCegarLoop]: 200 mSDtfsCounter, 151 mSDsluCounter, 449 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 151 SdHoareTripleChecker+Valid, 649 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 15:49:09,562 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [151 Valid, 649 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 15:49:09,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 547 states. [2025-01-09 15:49:09,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 547 to 452. [2025-01-09 15:49:09,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 452 states, 391 states have (on average 1.3580562659846547) internal successors, (531), 394 states have internal predecessors, (531), 54 states have call successors, (54), 6 states have call predecessors, (54), 6 states have return successors, (54), 51 states have call predecessors, (54), 54 states have call successors, (54) [2025-01-09 15:49:09,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 452 states to 452 states and 639 transitions. [2025-01-09 15:49:09,602 INFO L78 Accepts]: Start accepts. Automaton has 452 states and 639 transitions. Word has length 145 [2025-01-09 15:49:09,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:49:09,603 INFO L471 AbstractCegarLoop]: Abstraction has 452 states and 639 transitions. [2025-01-09 15:49:09,603 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 states have internal predecessors, (58), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-01-09 15:49:09,603 INFO L276 IsEmpty]: Start isEmpty. Operand 452 states and 639 transitions. [2025-01-09 15:49:09,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2025-01-09 15:49:09,605 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:49:09,605 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:49:09,613 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Ended with exit code 0 [2025-01-09 15:49:09,805 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 15:49:09,806 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:49:09,806 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:49:09,806 INFO L85 PathProgramCache]: Analyzing trace with hash 1653239143, now seen corresponding path program 1 times [2025-01-09 15:49:09,807 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 15:49:09,807 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [498147334] [2025-01-09 15:49:09,807 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:49:09,807 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:49:09,807 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 15:49:09,812 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-01-09 15:49:09,813 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2025-01-09 15:49:09,951 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 145 statements into 1 equivalence classes. [2025-01-09 15:49:10,039 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 145 of 145 statements. [2025-01-09 15:49:10,039 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:49:10,039 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:49:10,044 INFO L256 TraceCheckSpWp]: Trace formula consists of 355 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-01-09 15:49:10,047 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 15:49:10,392 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 16 proven. 116 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-01-09 15:49:10,392 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 15:49:10,502 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-01-09 15:49:10,503 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 15:49:10,503 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [498147334] [2025-01-09 15:49:10,503 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [498147334] provided 1 perfect and 1 imperfect interpolant sequences [2025-01-09 15:49:10,503 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 15:49:10,503 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [10] total 12 [2025-01-09 15:49:10,503 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [724071549] [2025-01-09 15:49:10,503 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:49:10,503 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 15:49:10,503 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 15:49:10,504 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 15:49:10,504 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2025-01-09 15:49:10,504 INFO L87 Difference]: Start difference. First operand 452 states and 639 transitions. Second operand has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-01-09 15:49:10,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:49:10,566 INFO L93 Difference]: Finished difference Result 809 states and 1148 transitions. [2025-01-09 15:49:10,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 15:49:10,567 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 145 [2025-01-09 15:49:10,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:49:10,570 INFO L225 Difference]: With dead ends: 809 [2025-01-09 15:49:10,570 INFO L226 Difference]: Without dead ends: 498 [2025-01-09 15:49:10,572 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 289 GetRequests, 278 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2025-01-09 15:49:10,572 INFO L435 NwaCegarLoop]: 182 mSDtfsCounter, 52 mSDsluCounter, 418 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 600 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 15:49:10,572 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 600 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 15:49:10,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 498 states. [2025-01-09 15:49:10,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 498 to 469. [2025-01-09 15:49:10,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 469 states, 408 states have (on average 1.357843137254902) internal successors, (554), 411 states have internal predecessors, (554), 54 states have call successors, (54), 6 states have call predecessors, (54), 6 states have return successors, (54), 51 states have call predecessors, (54), 54 states have call successors, (54) [2025-01-09 15:49:10,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 469 states to 469 states and 662 transitions. [2025-01-09 15:49:10,604 INFO L78 Accepts]: Start accepts. Automaton has 469 states and 662 transitions. Word has length 145 [2025-01-09 15:49:10,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:49:10,605 INFO L471 AbstractCegarLoop]: Abstraction has 469 states and 662 transitions. [2025-01-09 15:49:10,605 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-01-09 15:49:10,605 INFO L276 IsEmpty]: Start isEmpty. Operand 469 states and 662 transitions. [2025-01-09 15:49:10,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2025-01-09 15:49:10,607 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:49:10,607 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:49:10,614 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 (11)] Ended with exit code 0 [2025-01-09 15:49:10,807 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /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:49:10,808 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:49:10,808 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:49:10,808 INFO L85 PathProgramCache]: Analyzing trace with hash -1940663575, now seen corresponding path program 1 times [2025-01-09 15:49:10,808 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 15:49:10,809 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [324042073] [2025-01-09 15:49:10,809 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:49:10,809 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:49:10,809 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 15:49:10,811 INFO L229 MonitoredProcess]: Starting monitored process 12 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:49:10,814 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 (12)] Waiting until timeout for monitored process [2025-01-09 15:49:10,941 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 145 statements into 1 equivalence classes. [2025-01-09 15:49:11,049 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 145 of 145 statements. [2025-01-09 15:49:11,049 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:49:11,050 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:49:11,054 INFO L256 TraceCheckSpWp]: Trace formula consists of 353 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-01-09 15:49:11,057 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 15:49:11,384 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 14 proven. 222 refuted. 0 times theorem prover too weak. 376 trivial. 0 not checked. [2025-01-09 15:49:11,384 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 15:49:11,478 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-01-09 15:49:11,478 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 15:49:11,478 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [324042073] [2025-01-09 15:49:11,478 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [324042073] provided 1 perfect and 1 imperfect interpolant sequences [2025-01-09 15:49:11,478 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 15:49:11,479 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [10] total 12 [2025-01-09 15:49:11,479 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1912244048] [2025-01-09 15:49:11,479 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:49:11,479 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 15:49:11,479 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 15:49:11,479 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 15:49:11,480 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2025-01-09 15:49:11,480 INFO L87 Difference]: Start difference. First operand 469 states and 662 transitions. Second operand has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-01-09 15:49:11,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:49:11,567 INFO L93 Difference]: Finished difference Result 950 states and 1330 transitions. [2025-01-09 15:49:11,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 15:49:11,567 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 145 [2025-01-09 15:49:11,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:49:11,573 INFO L225 Difference]: With dead ends: 950 [2025-01-09 15:49:11,573 INFO L226 Difference]: Without dead ends: 629 [2025-01-09 15:49:11,575 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 289 GetRequests, 278 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2025-01-09 15:49:11,575 INFO L435 NwaCegarLoop]: 140 mSDtfsCounter, 54 mSDsluCounter, 370 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 510 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 15:49:11,575 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 510 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 15:49:11,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 629 states. [2025-01-09 15:49:11,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 629 to 625. [2025-01-09 15:49:11,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 625 states, 556 states have (on average 1.341726618705036) internal successors, (746), 561 states have internal predecessors, (746), 58 states have call successors, (58), 10 states have call predecessors, (58), 10 states have return successors, (58), 53 states have call predecessors, (58), 58 states have call successors, (58) [2025-01-09 15:49:11,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 625 states to 625 states and 862 transitions. [2025-01-09 15:49:11,608 INFO L78 Accepts]: Start accepts. Automaton has 625 states and 862 transitions. Word has length 145 [2025-01-09 15:49:11,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:49:11,608 INFO L471 AbstractCegarLoop]: Abstraction has 625 states and 862 transitions. [2025-01-09 15:49:11,608 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-01-09 15:49:11,609 INFO L276 IsEmpty]: Start isEmpty. Operand 625 states and 862 transitions. [2025-01-09 15:49:11,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2025-01-09 15:49:11,611 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:49:11,611 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:49:11,618 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 (12)] Ended with exit code 0 [2025-01-09 15:49:11,811 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /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:49:11,812 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:49:11,812 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:49:11,812 INFO L85 PathProgramCache]: Analyzing trace with hash -36944439, now seen corresponding path program 1 times [2025-01-09 15:49:11,812 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 15:49:11,812 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2086650428] [2025-01-09 15:49:11,812 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:49:11,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:49:11,813 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 15:49:11,815 INFO L229 MonitoredProcess]: Starting monitored process 13 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:49:11,816 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 (13)] Waiting until timeout for monitored process [2025-01-09 15:49:11,943 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 147 statements into 1 equivalence classes. [2025-01-09 15:49:12,027 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 147 of 147 statements. [2025-01-09 15:49:12,028 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:49:12,028 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:49:12,032 INFO L256 TraceCheckSpWp]: Trace formula consists of 362 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-01-09 15:49:12,036 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 15:49:12,307 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 16 proven. 116 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-01-09 15:49:12,307 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 15:49:12,415 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-01-09 15:49:12,416 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 15:49:12,416 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2086650428] [2025-01-09 15:49:12,416 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2086650428] provided 1 perfect and 1 imperfect interpolant sequences [2025-01-09 15:49:12,416 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 15:49:12,416 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [10] total 11 [2025-01-09 15:49:12,416 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [771311003] [2025-01-09 15:49:12,416 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:49:12,416 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 15:49:12,416 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 15:49:12,417 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 15:49:12,417 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2025-01-09 15:49:12,417 INFO L87 Difference]: Start difference. First operand 625 states and 862 transitions. Second operand has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-01-09 15:49:12,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:49:12,495 INFO L93 Difference]: Finished difference Result 1164 states and 1609 transitions. [2025-01-09 15:49:12,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 15:49:12,495 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 147 [2025-01-09 15:49:12,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:49:12,499 INFO L225 Difference]: With dead ends: 1164 [2025-01-09 15:49:12,500 INFO L226 Difference]: Without dead ends: 724 [2025-01-09 15:49:12,501 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 293 GetRequests, 283 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2025-01-09 15:49:12,501 INFO L435 NwaCegarLoop]: 131 mSDtfsCounter, 77 mSDsluCounter, 244 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 375 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 15:49:12,502 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 375 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 15:49:12,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 724 states. [2025-01-09 15:49:12,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 724 to 643. [2025-01-09 15:49:12,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 643 states, 574 states have (on average 1.3397212543554007) internal successors, (769), 579 states have internal predecessors, (769), 58 states have call successors, (58), 10 states have call predecessors, (58), 10 states have return successors, (58), 53 states have call predecessors, (58), 58 states have call successors, (58) [2025-01-09 15:49:12,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 643 states to 643 states and 885 transitions. [2025-01-09 15:49:12,531 INFO L78 Accepts]: Start accepts. Automaton has 643 states and 885 transitions. Word has length 147 [2025-01-09 15:49:12,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:49:12,532 INFO L471 AbstractCegarLoop]: Abstraction has 643 states and 885 transitions. [2025-01-09 15:49:12,532 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-01-09 15:49:12,532 INFO L276 IsEmpty]: Start isEmpty. Operand 643 states and 885 transitions. [2025-01-09 15:49:12,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2025-01-09 15:49:12,535 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:49:12,535 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:49:12,542 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Forceful destruction successful, exit code 0 [2025-01-09 15:49:12,735 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /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:49:12,736 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:49:12,736 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:49:12,736 INFO L85 PathProgramCache]: Analyzing trace with hash -1375074173, now seen corresponding path program 1 times [2025-01-09 15:49:12,737 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 15:49:12,737 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [902642142] [2025-01-09 15:49:12,737 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:49:12,737 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:49:12,737 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 15:49:12,739 INFO L229 MonitoredProcess]: Starting monitored process 14 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:49:12,742 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 (14)] Waiting until timeout for monitored process [2025-01-09 15:49:12,887 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 147 statements into 1 equivalence classes. [2025-01-09 15:49:12,989 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 147 of 147 statements. [2025-01-09 15:49:12,989 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:49:12,989 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:49:12,994 INFO L256 TraceCheckSpWp]: Trace formula consists of 374 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-01-09 15:49:12,997 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 15:49:13,374 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 11 [2025-01-09 15:49:13,392 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 5 proven. 303 refuted. 0 times theorem prover too weak. 304 trivial. 0 not checked. [2025-01-09 15:49:13,392 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 15:49:13,496 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-01-09 15:49:13,496 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 15:49:13,496 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [902642142] [2025-01-09 15:49:13,496 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [902642142] provided 1 perfect and 1 imperfect interpolant sequences [2025-01-09 15:49:13,496 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 15:49:13,496 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [10] total 12 [2025-01-09 15:49:13,496 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [447129105] [2025-01-09 15:49:13,496 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:49:13,496 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 15:49:13,496 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 15:49:13,497 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 15:49:13,497 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2025-01-09 15:49:13,497 INFO L87 Difference]: Start difference. First operand 643 states and 885 transitions. Second operand has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-01-09 15:49:13,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:49:13,644 INFO L93 Difference]: Finished difference Result 1655 states and 2280 transitions. [2025-01-09 15:49:13,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 15:49:13,645 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 147 [2025-01-09 15:49:13,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:49:13,650 INFO L225 Difference]: With dead ends: 1655 [2025-01-09 15:49:13,650 INFO L226 Difference]: Without dead ends: 1197 [2025-01-09 15:49:13,652 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 293 GetRequests, 282 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2025-01-09 15:49:13,652 INFO L435 NwaCegarLoop]: 167 mSDtfsCounter, 144 mSDsluCounter, 283 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 144 SdHoareTripleChecker+Valid, 450 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 15:49:13,652 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [144 Valid, 450 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 15:49:13,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1197 states. [2025-01-09 15:49:13,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1197 to 1194. [2025-01-09 15:49:13,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1194 states, 1083 states have (on average 1.339796860572484) internal successors, (1451), 1094 states have internal predecessors, (1451), 92 states have call successors, (92), 18 states have call predecessors, (92), 18 states have return successors, (92), 81 states have call predecessors, (92), 92 states have call successors, (92) [2025-01-09 15:49:13,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1194 states to 1194 states and 1635 transitions. [2025-01-09 15:49:13,701 INFO L78 Accepts]: Start accepts. Automaton has 1194 states and 1635 transitions. Word has length 147 [2025-01-09 15:49:13,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:49:13,701 INFO L471 AbstractCegarLoop]: Abstraction has 1194 states and 1635 transitions. [2025-01-09 15:49:13,702 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-01-09 15:49:13,702 INFO L276 IsEmpty]: Start isEmpty. Operand 1194 states and 1635 transitions. [2025-01-09 15:49:13,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2025-01-09 15:49:13,704 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:49:13,704 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:49:13,711 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 (14)] Ended with exit code 0 [2025-01-09 15:49:13,904 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /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:49:13,905 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:49:13,905 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:49:13,905 INFO L85 PathProgramCache]: Analyzing trace with hash -695015803, now seen corresponding path program 1 times [2025-01-09 15:49:13,906 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 15:49:13,906 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [262990086] [2025-01-09 15:49:13,906 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:49:13,906 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:49:13,906 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 15:49:13,911 INFO L229 MonitoredProcess]: Starting monitored process 15 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:49:13,921 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 (15)] Waiting until timeout for monitored process [2025-01-09 15:49:14,063 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 147 statements into 1 equivalence classes. [2025-01-09 15:49:14,179 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 147 of 147 statements. [2025-01-09 15:49:14,180 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:49:14,180 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:49:14,185 INFO L256 TraceCheckSpWp]: Trace formula consists of 375 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-01-09 15:49:14,188 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 15:49:14,307 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:49:14,389 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 41 [2025-01-09 15:49:14,407 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-01-09 15:49:14,407 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 15:49:14,407 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 15:49:14,407 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [262990086] [2025-01-09 15:49:14,407 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [262990086] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:49:14,407 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:49:14,408 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 15:49:14,408 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1061224498] [2025-01-09 15:49:14,408 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:49:14,408 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 15:49:14,408 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 15:49:14,408 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 15:49:14,408 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-01-09 15:49:14,409 INFO L87 Difference]: Start difference. First operand 1194 states and 1635 transitions. Second operand has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 6 states have internal predecessors, (60), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-01-09 15:49:14,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:49:14,548 INFO L93 Difference]: Finished difference Result 1232 states and 1684 transitions. [2025-01-09 15:49:14,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 15:49:14,548 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 6 states have internal predecessors, (60), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 147 [2025-01-09 15:49:14,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:49:14,553 INFO L225 Difference]: With dead ends: 1232 [2025-01-09 15:49:14,553 INFO L226 Difference]: Without dead ends: 1230 [2025-01-09 15:49:14,554 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 141 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2025-01-09 15:49:14,554 INFO L435 NwaCegarLoop]: 204 mSDtfsCounter, 121 mSDsluCounter, 646 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 121 SdHoareTripleChecker+Valid, 850 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 15:49:14,554 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [121 Valid, 850 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 15:49:14,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1230 states. [2025-01-09 15:49:14,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1230 to 1230. [2025-01-09 15:49:14,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1230 states, 1119 states have (on average 1.3288650580875783) internal successors, (1487), 1130 states have internal predecessors, (1487), 92 states have call successors, (92), 18 states have call predecessors, (92), 18 states have return successors, (92), 81 states have call predecessors, (92), 92 states have call successors, (92) [2025-01-09 15:49:14,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1230 states to 1230 states and 1671 transitions. [2025-01-09 15:49:14,595 INFO L78 Accepts]: Start accepts. Automaton has 1230 states and 1671 transitions. Word has length 147 [2025-01-09 15:49:14,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:49:14,595 INFO L471 AbstractCegarLoop]: Abstraction has 1230 states and 1671 transitions. [2025-01-09 15:49:14,595 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 6 states have internal predecessors, (60), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-01-09 15:49:14,595 INFO L276 IsEmpty]: Start isEmpty. Operand 1230 states and 1671 transitions. [2025-01-09 15:49:14,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2025-01-09 15:49:14,597 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:49:14,597 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:49:14,604 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 (15)] Ended with exit code 0 [2025-01-09 15:49:14,797 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /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:49:14,797 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:49:14,798 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:49:14,798 INFO L85 PathProgramCache]: Analyzing trace with hash -693168761, now seen corresponding path program 1 times [2025-01-09 15:49:14,798 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 15:49:14,798 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1958716581] [2025-01-09 15:49:14,798 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:49:14,798 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:49:14,798 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 15:49:14,800 INFO L229 MonitoredProcess]: Starting monitored process 16 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:49:14,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 (16)] Waiting until timeout for monitored process [2025-01-09 15:49:14,944 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 147 statements into 1 equivalence classes. [2025-01-09 15:49:15,058 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 147 of 147 statements. [2025-01-09 15:49:15,058 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:49:15,058 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:49:15,063 INFO L256 TraceCheckSpWp]: Trace formula consists of 373 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-01-09 15:49:15,067 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 15:49:15,744 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 30 treesize of output 26 [2025-01-09 15:49:15,841 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 93 treesize of output 81 [2025-01-09 15:49:15,845 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 81 treesize of output 69 [2025-01-09 15:49:15,849 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 69 treesize of output 57 [2025-01-09 15:49:15,886 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 320 refuted. 0 times theorem prover too weak. 292 trivial. 0 not checked. [2025-01-09 15:49:15,886 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 15:49:16,041 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-01-09 15:49:16,041 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 15:49:16,041 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1958716581] [2025-01-09 15:49:16,041 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1958716581] provided 1 perfect and 1 imperfect interpolant sequences [2025-01-09 15:49:16,041 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 15:49:16,041 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [8] total 10 [2025-01-09 15:49:16,042 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2068053696] [2025-01-09 15:49:16,042 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:49:16,042 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 15:49:16,042 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 15:49:16,042 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 15:49:16,042 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2025-01-09 15:49:16,043 INFO L87 Difference]: Start difference. First operand 1230 states and 1671 transitions. Second operand has 6 states, 6 states have (on average 10.0) internal successors, (60), 6 states have internal predecessors, (60), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-01-09 15:49:16,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:49:16,256 INFO L93 Difference]: Finished difference Result 3257 states and 4415 transitions. [2025-01-09 15:49:16,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 15:49:16,257 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.0) internal successors, (60), 6 states have internal predecessors, (60), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 147 [2025-01-09 15:49:16,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:49:16,267 INFO L225 Difference]: With dead ends: 3257 [2025-01-09 15:49:16,267 INFO L226 Difference]: Without dead ends: 2335 [2025-01-09 15:49:16,269 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 295 GetRequests, 284 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2025-01-09 15:49:16,269 INFO L435 NwaCegarLoop]: 163 mSDtfsCounter, 82 mSDsluCounter, 593 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 756 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 15:49:16,270 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 756 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 15:49:16,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2335 states. [2025-01-09 15:49:16,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2335 to 1928. [2025-01-09 15:49:16,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1928 states, 1817 states have (on average 1.3533296642817831) internal successors, (2459), 1828 states have internal predecessors, (2459), 92 states have call successors, (92), 18 states have call predecessors, (92), 18 states have return successors, (92), 81 states have call predecessors, (92), 92 states have call successors, (92) [2025-01-09 15:49:16,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1928 states to 1928 states and 2643 transitions. [2025-01-09 15:49:16,352 INFO L78 Accepts]: Start accepts. Automaton has 1928 states and 2643 transitions. Word has length 147 [2025-01-09 15:49:16,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:49:16,353 INFO L471 AbstractCegarLoop]: Abstraction has 1928 states and 2643 transitions. [2025-01-09 15:49:16,353 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.0) internal successors, (60), 6 states have internal predecessors, (60), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-01-09 15:49:16,353 INFO L276 IsEmpty]: Start isEmpty. Operand 1928 states and 2643 transitions. [2025-01-09 15:49:16,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2025-01-09 15:49:16,356 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:49:16,357 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:49:16,365 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 (16)] Ended with exit code 0 [2025-01-09 15:49:16,557 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /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:49:16,557 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:49:16,559 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:49:16,559 INFO L85 PathProgramCache]: Analyzing trace with hash -734405879, now seen corresponding path program 1 times [2025-01-09 15:49:16,559 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 15:49:16,559 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1419460660] [2025-01-09 15:49:16,559 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:49:16,560 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:49:16,560 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 15:49:16,562 INFO L229 MonitoredProcess]: Starting monitored process 17 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:49:16,565 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 (17)] Waiting until timeout for monitored process [2025-01-09 15:49:16,720 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 147 statements into 1 equivalence classes. [2025-01-09 15:49:16,827 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 147 of 147 statements. [2025-01-09 15:49:16,827 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:49:16,827 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:49:16,834 INFO L256 TraceCheckSpWp]: Trace formula consists of 358 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-01-09 15:49:16,838 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 15:49:17,150 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 16 proven. 116 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-01-09 15:49:17,151 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 15:49:17,238 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-01-09 15:49:17,238 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 15:49:17,238 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1419460660] [2025-01-09 15:49:17,238 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1419460660] provided 1 perfect and 1 imperfect interpolant sequences [2025-01-09 15:49:17,238 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 15:49:17,238 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [10] total 12 [2025-01-09 15:49:17,238 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1637412334] [2025-01-09 15:49:17,238 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:49:17,239 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 15:49:17,239 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 15:49:17,239 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 15:49:17,239 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2025-01-09 15:49:17,239 INFO L87 Difference]: Start difference. First operand 1928 states and 2643 transitions. Second operand has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-01-09 15:49:17,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:49:17,322 INFO L93 Difference]: Finished difference Result 3310 states and 4543 transitions. [2025-01-09 15:49:17,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 15:49:17,323 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 147 [2025-01-09 15:49:17,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:49:17,330 INFO L225 Difference]: With dead ends: 3310 [2025-01-09 15:49:17,331 INFO L226 Difference]: Without dead ends: 1844 [2025-01-09 15:49:17,334 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 293 GetRequests, 282 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2025-01-09 15:49:17,334 INFO L435 NwaCegarLoop]: 178 mSDtfsCounter, 126 mSDsluCounter, 290 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 468 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 15:49:17,335 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [126 Valid, 468 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 15:49:17,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1844 states. [2025-01-09 15:49:17,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1844 to 1776. [2025-01-09 15:49:17,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1776 states, 1665 states have (on average 1.3375375375375376) internal successors, (2227), 1676 states have internal predecessors, (2227), 92 states have call successors, (92), 18 states have call predecessors, (92), 18 states have return successors, (92), 81 states have call predecessors, (92), 92 states have call successors, (92) [2025-01-09 15:49:17,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1776 states to 1776 states and 2411 transitions. [2025-01-09 15:49:17,398 INFO L78 Accepts]: Start accepts. Automaton has 1776 states and 2411 transitions. Word has length 147 [2025-01-09 15:49:17,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:49:17,398 INFO L471 AbstractCegarLoop]: Abstraction has 1776 states and 2411 transitions. [2025-01-09 15:49:17,399 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-01-09 15:49:17,399 INFO L276 IsEmpty]: Start isEmpty. Operand 1776 states and 2411 transitions. [2025-01-09 15:49:17,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2025-01-09 15:49:17,401 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:49:17,401 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:49:17,408 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Forceful destruction successful, exit code 0 [2025-01-09 15:49:17,605 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /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:49:17,605 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:49:17,605 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:49:17,605 INFO L85 PathProgramCache]: Analyzing trace with hash -593857269, now seen corresponding path program 1 times [2025-01-09 15:49:17,606 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 15:49:17,606 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1710964639] [2025-01-09 15:49:17,606 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:49:17,606 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:49:17,606 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 15:49:17,608 INFO L229 MonitoredProcess]: Starting monitored process 18 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:49:17,609 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 (18)] Waiting until timeout for monitored process [2025-01-09 15:49:17,745 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 147 statements into 1 equivalence classes. [2025-01-09 15:49:17,824 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 147 of 147 statements. [2025-01-09 15:49:17,824 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:49:17,825 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:49:17,829 INFO L256 TraceCheckSpWp]: Trace formula consists of 356 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-01-09 15:49:17,832 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 15:49:18,111 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 14 proven. 222 refuted. 0 times theorem prover too weak. 376 trivial. 0 not checked. [2025-01-09 15:49:18,111 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 15:49:18,190 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-01-09 15:49:18,190 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 15:49:18,190 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1710964639] [2025-01-09 15:49:18,190 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1710964639] provided 1 perfect and 1 imperfect interpolant sequences [2025-01-09 15:49:18,190 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 15:49:18,190 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [10] total 11 [2025-01-09 15:49:18,190 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2028550351] [2025-01-09 15:49:18,190 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:49:18,191 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 15:49:18,191 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 15:49:18,191 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 15:49:18,191 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2025-01-09 15:49:18,191 INFO L87 Difference]: Start difference. First operand 1776 states and 2411 transitions. Second operand has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-01-09 15:49:18,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:49:18,284 INFO L93 Difference]: Finished difference Result 3060 states and 4157 transitions. [2025-01-09 15:49:18,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 15:49:18,285 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 147 [2025-01-09 15:49:18,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:49:18,289 INFO L225 Difference]: With dead ends: 3060 [2025-01-09 15:49:18,289 INFO L226 Difference]: Without dead ends: 1746 [2025-01-09 15:49:18,292 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 293 GetRequests, 283 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2025-01-09 15:49:18,292 INFO L435 NwaCegarLoop]: 164 mSDtfsCounter, 42 mSDsluCounter, 396 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 560 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 15:49:18,292 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 560 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 15:49:18,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1746 states. [2025-01-09 15:49:18,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1746 to 1488. [2025-01-09 15:49:18,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1488 states, 1384 states have (on average 1.329479768786127) internal successors, (1840), 1391 states have internal predecessors, (1840), 84 states have call successors, (84), 19 states have call predecessors, (84), 19 states have return successors, (84), 77 states have call predecessors, (84), 84 states have call successors, (84) [2025-01-09 15:49:18,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1488 states to 1488 states and 2008 transitions. [2025-01-09 15:49:18,338 INFO L78 Accepts]: Start accepts. Automaton has 1488 states and 2008 transitions. Word has length 147 [2025-01-09 15:49:18,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:49:18,339 INFO L471 AbstractCegarLoop]: Abstraction has 1488 states and 2008 transitions. [2025-01-09 15:49:18,339 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-01-09 15:49:18,339 INFO L276 IsEmpty]: Start isEmpty. Operand 1488 states and 2008 transitions. [2025-01-09 15:49:18,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2025-01-09 15:49:18,340 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:49:18,340 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:49:18,347 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 (18)] Ended with exit code 0 [2025-01-09 15:49:18,541 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /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:49:18,541 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:49:18,541 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:49:18,542 INFO L85 PathProgramCache]: Analyzing trace with hash -9409805, now seen corresponding path program 1 times [2025-01-09 15:49:18,542 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 15:49:18,542 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1775055711] [2025-01-09 15:49:18,542 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:49:18,542 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:49:18,542 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 15:49:18,544 INFO L229 MonitoredProcess]: Starting monitored process 19 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:49:18,545 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 (19)] Waiting until timeout for monitored process [2025-01-09 15:49:18,690 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 148 statements into 1 equivalence classes. [2025-01-09 15:49:18,765 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 148 of 148 statements. [2025-01-09 15:49:18,766 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:49:18,766 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:49:18,770 INFO L256 TraceCheckSpWp]: Trace formula consists of 357 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-01-09 15:49:18,773 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 15:49:19,065 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 12 proven. 296 refuted. 0 times theorem prover too weak. 304 trivial. 0 not checked. [2025-01-09 15:49:19,065 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 15:49:19,177 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-01-09 15:49:19,177 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 15:49:19,177 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1775055711] [2025-01-09 15:49:19,177 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1775055711] provided 1 perfect and 1 imperfect interpolant sequences [2025-01-09 15:49:19,177 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 15:49:19,177 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [11] total 13 [2025-01-09 15:49:19,177 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1451644277] [2025-01-09 15:49:19,177 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:49:19,177 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 15:49:19,178 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 15:49:19,178 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 15:49:19,178 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2025-01-09 15:49:19,178 INFO L87 Difference]: Start difference. First operand 1488 states and 2008 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, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-01-09 15:49:19,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:49:19,276 INFO L93 Difference]: Finished difference Result 2820 states and 3787 transitions. [2025-01-09 15:49:19,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 15:49:19,277 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, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 148 [2025-01-09 15:49:19,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:49:19,284 INFO L225 Difference]: With dead ends: 2820 [2025-01-09 15:49:19,284 INFO L226 Difference]: Without dead ends: 1770 [2025-01-09 15:49:19,286 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 295 GetRequests, 283 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2025-01-09 15:49:19,287 INFO L435 NwaCegarLoop]: 196 mSDtfsCounter, 137 mSDsluCounter, 447 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 643 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 15:49:19,287 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [137 Valid, 643 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 15:49:19,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1770 states. [2025-01-09 15:49:19,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1770 to 1532. [2025-01-09 15:49:19,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1532 states, 1428 states have (on average 1.3221288515406162) internal successors, (1888), 1435 states have internal predecessors, (1888), 84 states have call successors, (84), 19 states have call predecessors, (84), 19 states have return successors, (84), 77 states have call predecessors, (84), 84 states have call successors, (84) [2025-01-09 15:49:19,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1532 states to 1532 states and 2056 transitions. [2025-01-09 15:49:19,336 INFO L78 Accepts]: Start accepts. Automaton has 1532 states and 2056 transitions. Word has length 148 [2025-01-09 15:49:19,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:49:19,337 INFO L471 AbstractCegarLoop]: Abstraction has 1532 states and 2056 transitions. [2025-01-09 15:49:19,337 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, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-01-09 15:49:19,337 INFO L276 IsEmpty]: Start isEmpty. Operand 1532 states and 2056 transitions. [2025-01-09 15:49:19,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2025-01-09 15:49:19,339 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:49:19,339 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:49:19,356 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 (19)] Ended with exit code 0 [2025-01-09 15:49:19,539 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /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:49:19,540 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:49:19,540 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:49:19,540 INFO L85 PathProgramCache]: Analyzing trace with hash 248755633, now seen corresponding path program 1 times [2025-01-09 15:49:19,541 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 15:49:19,541 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [856472192] [2025-01-09 15:49:19,541 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:49:19,541 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:49:19,541 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 15:49:19,543 INFO L229 MonitoredProcess]: Starting monitored process 20 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:49:19,544 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 (20)] Waiting until timeout for monitored process [2025-01-09 15:49:19,684 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 148 statements into 1 equivalence classes. [2025-01-09 15:49:19,765 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 148 of 148 statements. [2025-01-09 15:49:19,765 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:49:19,765 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:49:19,770 INFO L256 TraceCheckSpWp]: Trace formula consists of 360 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-01-09 15:49:19,773 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 15:49:19,791 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-01-09 15:49:19,791 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 15:49:19,791 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 15:49:19,791 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [856472192] [2025-01-09 15:49:19,791 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [856472192] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:49:19,791 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:49:19,791 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 15:49:19,791 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1392098059] [2025-01-09 15:49:19,792 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:49:19,792 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 15:49:19,792 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 15:49:19,792 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 15:49:19,792 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 15:49:19,793 INFO L87 Difference]: Start difference. First operand 1532 states and 2056 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, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-01-09 15:49:19,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:49:19,860 INFO L93 Difference]: Finished difference Result 2658 states and 3588 transitions. [2025-01-09 15:49:19,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 15:49:19,860 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, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 148 [2025-01-09 15:49:19,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:49:19,868 INFO L225 Difference]: With dead ends: 2658 [2025-01-09 15:49:19,868 INFO L226 Difference]: Without dead ends: 1580 [2025-01-09 15:49:19,870 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 143 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 15:49:19,870 INFO L435 NwaCegarLoop]: 134 mSDtfsCounter, 0 mSDsluCounter, 510 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 644 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 15:49:19,870 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 644 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 15:49:19,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1580 states. [2025-01-09 15:49:19,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1580 to 1568. [2025-01-09 15:49:19,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1568 states, 1464 states have (on average 1.314207650273224) internal successors, (1924), 1471 states have internal predecessors, (1924), 84 states have call successors, (84), 19 states have call predecessors, (84), 19 states have return successors, (84), 77 states have call predecessors, (84), 84 states have call successors, (84) [2025-01-09 15:49:19,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1568 states to 1568 states and 2092 transitions. [2025-01-09 15:49:19,914 INFO L78 Accepts]: Start accepts. Automaton has 1568 states and 2092 transitions. Word has length 148 [2025-01-09 15:49:19,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:49:19,914 INFO L471 AbstractCegarLoop]: Abstraction has 1568 states and 2092 transitions. [2025-01-09 15:49:19,915 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, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-01-09 15:49:19,915 INFO L276 IsEmpty]: Start isEmpty. Operand 1568 states and 2092 transitions. [2025-01-09 15:49:19,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2025-01-09 15:49:19,917 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:49:19,917 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 15:49:19,925 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 (20)] Ended with exit code 0 [2025-01-09 15:49:20,117 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /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:49:20,118 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:49:20,118 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:49:20,118 INFO L85 PathProgramCache]: Analyzing trace with hash 657804547, now seen corresponding path program 1 times [2025-01-09 15:49:20,119 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 15:49:20,119 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [972495155] [2025-01-09 15:49:20,119 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:49:20,119 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:49:20,119 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 15:49:20,121 INFO L229 MonitoredProcess]: Starting monitored process 21 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:49:20,123 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 (21)] Waiting until timeout for monitored process [2025-01-09 15:49:20,291 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 149 statements into 1 equivalence classes. [2025-01-09 15:49:20,505 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 149 of 149 statements. [2025-01-09 15:49:20,505 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:49:20,505 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:49:20,511 INFO L256 TraceCheckSpWp]: Trace formula consists of 376 conjuncts, 47 conjuncts are in the unsatisfiable core [2025-01-09 15:49:20,516 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 15:49:24,763 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 49 treesize of output 37 [2025-01-09 15:49:24,769 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 45 treesize of output 33 [2025-01-09 15:49:24,774 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 41 treesize of output 29 [2025-01-09 15:49:25,710 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 27